System and method for providing customized electronic newspapers and target advertisements

ABSTRACT

This invention relates to customized electronic identification of desirable objects, such as news articles, in an electronic media environment, and in particular to a system that automatically constructs both a “target profile” for each target object in the electronic media based, for example, on the frequency with which each word appears in an article relative to its overall frequency of use in all articles, as well as a “target profile interest summary” for each user, which target profile interest summary describes the user&#39;s interest level in various types of target objects. The system then evaluates the target profiles against the users&#39; target profile interest summaries to generate a user-customized rank ordered listing of target objects most likely to be of interest to each user so that the user can select from among these potentially relevant target objects, which were automatically selected by this system from the plethora of target objects that are profiled on the electronic media. Users&#39; target profile interest summaries can be used to efficiently organize the distribution of information in a large scale system consisting of many users interconnected by means of a communication network. Additionally, a cryptographically-based pseudonym proxy server is provided to ensure the privacy of a user&#39;s target profile interest summary, by giving the user control over the ability of third parties to access this summary and to identify or contact the user.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application was originally filed as provisional applicationSerial No. 60/032,462, filed on Dec. 9, 1996 and is acontinuation-in-part of U.S. patent application Ser. No. 08/346,425,filed Nov. 28, 1994 now U.S. Pat. No. 5,758, 257, and titled “SYSTEM ANDMETHOD FOR SCHEDULING BROADCAST OF AND ACCESS TO VIDEO PROGRAMS ANDOTHER DATA USING CUSTOMER PROFILES”, which application is assigned tothe same assignee as the present application.

FIELD OF INVENTION

This invention relates to customized electronic identification ofdesirable objects, such as news articles, in an electronic mediaenvironment, and in particular to a system that automatically constructsboth a “target profile” for each target object in the electronic mediabased, for example, on the frequency with which each word appears in anarticle relative to its overall frequency of use in all articles, aswell as a “target profile interest summary” for each user, which targetprofile interest summary describes the user's interest level in varioustypes of tar get objects. The system then evaluates the target profilesagainst the users' target profile interest summaries to generate auser-customized rank ordered listing of target objects most likely to beof interest to each user so that the user can select from among thesepotentially relevant target objects, which were automatically selectedby this system from the plethora of target objects that are profiled. onthe electronic media. Users' target profile interest summaries can beused to efficiently organize the distribution of information in a largescale system consisting of many users interconnected by means of acommunication network. Additionally, a cryptographically based proxyserver is provided to ensure privacy of a user's target profile interestsummary, by giving the user control over the ability of third parties toaccess this summary and to identify or contact the user.

PROBLEM

It is a problem in the field of electronic media to enable a user toaccess information of relevance and interest to the user withoutrequiring the user to expend an excessive amount of time and energysearching for the information. Electronic media, such as on-lineinformation sources, provide a vast amount of information to users,typically in the form of “articles,” each of which comprises apublication item, or document that relates to a specific topic. Thedifficulty with electronic media is that the amount of informationavailable to the user is overwhelming and the article repository systemsthat are connected on-line are not organized in a manner thatsufficiently simplifies access to only the articles-of interest to theuser. Presently, a user either fails to access relevant articles becausethey are not easily identified or expends a significant amount of timeand energy to conduct an exhaustive search of all articles to identifythose most likely to be of interest to the user. Furthermore, even ifthe user conducts an exhaustive search, present information searchingtechniques do not necessarily accurately extract only the most relevantarticles, but also present articles of marginal relevance due to thefunctional limitations of the information searching techniques. There isalso no existing system which automatically estimates the inherentquality of a n article or other target object to distinguish among anumber of articles or target objects identified as of possible interestto a user.

Therefore, in the field of information retrieval, there is along-standing need for a system which enables users to navigate throughthe plethora of information. With commercialization of communicationnetworks, such as the Internet, the growth of available information hasincreased. Customization of the information delivery process to theuser's unique tastes and interests is the ultimate solution to thisproblem. However, the techniques which have been proposed to date eitheronly address the user's interests on a superficial level or providegreater depth and intelligence at the cost of unwanted demands on theuser's time and energy. While many researchers have agreed thattraditional methods have been lacking in this regard, no one to date hassuccessfully addressed these problems in a holistic manner and provideda system that can fully learn and reflect the user's tastes andinterests. This is particularly true in a practical commercial context,such as on-line services available on the Internet. There is a need foran information retrieval system, that is largely or entirely passive,unobtrusive, undemanding of the user, and yet both precise andcomprehensive in its ability to learn and truly represent the user'stastes and interests. Present information retrieval systems require theuser to specify the desired information retrieval behavior throughcumbersome interfaces.

Users may receive information on a computer network either by activelyretrieving the information or by passively receiving information that issent to them. Just as users of information retrieval systems face theproblem of too much information, so do users who are targeted withelectronic junk mail by individuals and organizations. An ideal systemwould protect the user from unsolicited advertising, both byautomatically extracting only the most relevant messages received byelectronic mail, and by preserving the confidentiality of the user'spreferences, which should not be freely available to others on thenetwork.

Researchers in the field of published article information retrieval havedevoted considerable effort to finding efficient and accurate methods ofallowing users to select articles of interest from a large set ofarticles. The most widely used methods of information retrieval arebased on keyword matching: the user specifies a set of keywords whichthe user thinks are exclusively found in the desired articles and theinformation retrieval computer retrieves all articles which containthose keywords. Such methods are fast, but are notoriously unreliable,as users may not think of the right keywords, or the keywords may beused in unwanted articles in an irrelevant or unexpected context. As aresult, the information retrieval computers retrieve many articles whichare unwanted by the user. The logical combination of keywords and theuse of wild-card search parameters help improve the accuracy of keywordsearching but do not completely solve the problem of inaccurate searchresults. Starting in the 1960's, an alternate approach to informationretrieval was developed: users were presented with an article and askedif it contained the information they wanted, or to quantify how closethe information contained in the article was to what they wanted. Eacharticle was described by a profile which comprised either a list of thewords in the article or, in more advanced systems, a table of wordfrequencies in the article. Since a measure of similarity betweenarticles is the distance between their profiles, the measured similarityof article profiles can be used in article retrieval. For example, auser searching for information on a subject can write a shortdescription of the desired information. The information retrievalcomputer generates an article profile for the request and then retrievesarticles with profiles similar to the profile generated for the request.These requests can then be refined using “relevance feedback”, where theuser actively or passively rates the articles retrieved as to how closethe information contained therein is to what is desired. The informationretrieval computer then uses this relevance feedback information torefine the request profile and the process is repeated until the usereither finds enough articles or tires of the search.

A number of researchers have looked at methods for selecting articles ofmost interest to users. An article titled “Social Information filtering:algorithms for automating ‘word of mouth’” was published at the CHi-95Proceedings by Patti Maes et al and describes the Ringo informationretrieval system which recommends musical selections. The Ringo systemrequires active feedback from the users—users must manually specify howmuch they like or dislike each musical selection. The Ringo systemmaintains a complete list of users ratings of music selections and makesrecommendations by finding which selections were liked by multiplepeople. However, the Ringo system does not take advantage of anyavailable descriptions of the music, such as structured descriptions ina data base, or free text, such as that contained in music reviews. Anarticle titled “Evolving agents for personalized information filtering”,published at the Proc. 9th IEEE Conf on AI for Applications by Sheth andMaes, described the use of agents for information filtering which usegenetic algorithms to learn to categorize Usenet news articles. In thissystem, users must define news categories and the users activelyindicate their opinion of the selected articles. Their system uses alist of keywords to represent sets of articles and the records of users'interests are updated using genetic algorithms.

A number of other research groups have looked at the automaticgeneration and labeling of clusters of articles for the purpose ofbrowsing through the articles. A group at Xerox Parc published a papertitled “Scatter/gather: a cluster-based approach to browsing largearticle collections” at the 15 Ann. Int'l SIGIR '92, ACM 318-329(Cutting et al. 1992). This group developed a method they call“scatter/gather” for performing information retrieval searches. In thismethod, a collection of articles is “scattered” into a small number ofclusters, the user then chooses one or more of these clusters based onshort summaries of the cluster. The selected clusters are then“gathered” into a subcollection, and then the process is repeated. Eachiteration of this process is expected to produce a small, more focusedcollection. The cluster “summaries” are generated by picking those wordswhich appear most frequently in the cluster and the titles of thosearticles closest to the center of the cluster. However, no feedback fromusers is collected or stored, so no performance improvement occurs overtime.

Apple's Advanced Technology Group has developed an interface based onthe concept of a “pile of articles”. This interface is described in anarticle titled “‘A pile’ metaphor for supporting casual organization ofinformation in Human factors in computer systems” published in CHI '92Conf. Proc. 627-634 by Mander, R. G. Salomon and Y. Wong. 1992. Anotherarticle titled “Content awareness in a file system interface:implementing the ‘pile’ metaphor for organizing information” waspublished in 16 Ann. Int'l SIGIR '93, ACM 260-269 by Rose E. D. et al.The Apple interface uses word frequencies to automatically file articlesby picking the pile most similar to the article being filed. This systemfunctions to cluster articles into subpiles, determine key words forindexing by picking the words with the largest TF/IDF (where TF is term(word) frequency and IDF is the inverse document frequency) and labelpiles by using the determined key words.

Numerous patents address information retrieval methods, but none developrecords of a user's interest based on passive monitoring of whicharticles the user accesses. None of the systems described in thesepatents pre sent computer architectures to allow fast retrieval ofarticles distributed across many computers. None of the systemsdescribed in these patents address issues of using such articleretrieval and matching methods for purposes of commerce or of matchingusers with common interests or developing records of users' interests.U.S. Pat. No. 5,321,833 issued to Chang et al. teaches a method in whichusers choose terms to use in an information retrieval query, and specifythe relative weightings of the different terms. The Chang system thencalculates multiple levels of weighting criteria. U.S. Pat. No.5,301,109 issued to Landauer et al teaches a method for retrievingarticles in a multiplicity of languages by constructing “latent vectors”(SVD or PCA vectors) which represent correlations between the differentwords. U.S. Pat. No. 5,331,554 issued to Graham et al. discloses amethod for retrieving segments of a manual by comparing a query withnodes in a decision tree. U.S. Pat. No. 5,331,556 addresses techniquesfor deriving morphological part-of-speech information and thus to make:use of the similarities of different forms of the same word (e.g.“article” and “articles”).

Therefore, there presently is no information retrieval and deliverysystem operable in an electronic media environment that enables a userto access information of relevance and interest to the user withoutrequiring the user to expend an excessive amount of time and energy.

SOLUTION

The above-described problems are solved and a technical advance achievedin the field by the system for customized electronic identification ofdesirable objects in an electronic media environment, which systemenables a user to access target objects of relevance and interest to theuser without requiring the user to expend an excessive amount of timeand energy. Profiles of the target objects are stored on electronicmedia and are accessible via a data communication network. In manyapplications, the target objects are informational I n nature, and somay themselves be stored on electronic media and be accessible via adata communication network.

Relevant definitions of terms for the purpose of this descriptioninclude: (a.) an object available for access by the user, which may beeither physical or electronic in nature, is termed a “target object”,(b.) a digitally represented profile indicating t hat target object'sattributes is termed a “target profile”, (c.) the user looking for thetarget object is termed a “user”, (d.) a profile holding that user'sattributes, including age/zip code/etc. is termed a “user profile”, (e.)a summary of digital profiles of target objects that a user likes and/ordislikes, is termed the “target profile interest summary” of that user,(f) a profile consisting of a collection of attributes, such that a userlikes target objects whose profiles are similar to this collection, ofattributes, is termed a “search profile” or in some contexts a “query”or “query profile,” (g.) a specific embodiment of the target profileinterest summary which comprises a set of search profiles is termed the“search profile set” of a user, (h.) a collection of target objects withsimilar profiles, is termed a “cluster,” (i.) an aggregate profileformed by averaging the attributes of all tar get objects in a cluster,termed a “cluster profile,” (j.) a real number determined by calculatingthe statistical variance of the profiles of all target objects in acluster, is termed a “cluster variance,” (k.) a real number determinedby calculating the maximum distance between the profiles of any twotarget objects in a cluster, is termed a “cluster diameter.”

The system for electronic identification of desirable objects of thepresent invention automatically constructs both a target profile foreach target object in the electronic media based, for example, on thefrequency with which each word appears in an article relative to itsoverall frequency of use in all articles, as well as a “target profileinterest summary” for each user, which target profile interest summarydescribes the user's interest level in various types of target objects.The system then evaluates the target profiles against the users' targetprofile interest summaries to generate a user-customized rank orderedlisting of tar get objects most likely to be of interest to each user sothat the user can select from among these potentially relevant targetobjects, which were automatically selected by this system from theplethora of target objects available on the electronic media.

Because people have multiple interests, a target profile interest,summary for a single user must represent multiple areas of interest, forexample, by consisting of a set of individual search profiles, each ofwhich identifies one of the user's areas of interest. Each user ispresented with those target objects whose profiles most closely matchthe user's interests as described by the user's target profile interestsummary. Users' target profile interest summaries are automaticallyupdated on a continuing basis to reflect each user's changing interests.In addition, target objects can be grouped into clusters based on theirsimilarity to each other, for example, based on similarity of theirtopics in the case where the target objects are published articles; andmenus automatically generated for each cluster of target objects toallow users to navigate throughout the clusters and manually locatetarget objects of interest. For reasons of confidentiality and privacy,a particular user may not wish to make public all of the interestsrecorded in the user's target profile interest summary, particularlywhen these interests are determined by the user's purchasing patterns.The user may desire that all or part of the target profile interestsummary be kept confidential, such as information relating to the user'spolitical, religious, financial or purchasing behavior; indeed,confidentiality with respect to purchasing behavior is the user's legalright in many states. It is therefore necessary that data in a user'starget profile interest summary be protected from unwanted disclosureexcept with the user's agreement. At the same time, the user's targetprofile interest summaries must be accessible to the relevant serversthat perform the matching of target objects to the users, if the benefitof this matching is desired by both providers and consumers of thetarget objects. The disclosed system provides a solution to the privacyproblem by using a proxy server which acts as an intermediary betweenthe information provider and the user. The proxy server dissociates theuser's true identity from the pseudonym by the use of cryptographictechniques. The proxy server also permits users to control access totheir target profile interest summaries and/or user profiles, includingprovision of this information to marketers and advertisers if they sodesire, possibly in exchange for cash or other considerations. Marketersmay purchase these profiles in order to target advertisements toparticular users, or they may purchase partial user profiles, which donot include enough information to identify the individual users inquestion, in order to carry out standard kinds of demographic analysisand market research on the resulting database of partial user profiles.

In the preferred embodiment of the invention, the system for customizedelectronic identification of desirable objects uses a fundamentalmethodology for accurately and efficiently matching users and targetobjects by automatically calculating, using and updating profileinformation that describes both the users' interests and the targetobjects' characteristics. The target objects may be published articles,purchasable items, or even other people, and their properties arestored, and/or represented and/or denoted on the electronic media as(digital) data. Examples of target objects can include, but are notlimited to: a newspaper story of potential interest, a movie to watch,an item to buy, e-mail to receive, or another person to correspond with.In all these cases, the information delivery process in the preferredembodiment is based on determining the similarity between a profile forthe target object and the profiles of target objects for which the user(or a similar user) has provided positive feedback in the past. Theindividual data that describe a target object and constitute the targetobject's profile are herein termed “attributes” of the target object.Attributes may include, but are not limited to, the following: (1) longpieces of text ( a newspaper story, a movie review, a productdescription or an advertisement), (2) short pieces of text (name of amovie's director, name of town from which an advertisement was placed,name of the language in which an article was written), (3) numericmeasurements (price of a product, rating given to a movie, reading levelof a book), (4) associations with other types of objects (list of actorsin a movie, list of persons who have read a document). Any of theseattributes, but especially the numeric ones, may correlate with thequality of the target object, such as measures of its popularity (howoften it is accessed) or of user satisfaction (number of complaintsreceived).

The preferred embodiment of the system for customized electronicidentification of desirable objects operates in an electronic mediaenvironment for accessing these target objects, which may be news,electronic mail, other published documents, or product descriptions. Thesystem in its broadest construction comprises three conceptual modules,which may be separate entities distributed across many implementingsystems, or combined into a lesser subset of physical entities. Thespecific embodiment of this system disclosed herein illustrates the useof a first module which automatically constructs a “target profile” foreach target object in the electronic media based on various descriptiveattributes of the target object. A second module uses interest feedbackfrom users to construct a “target profile interest summary” for eachuser, for example in the form of a “search profile set” consisting of aplurality of search profiles, each of which corresponds to a singletopic of high interest for the user. The system further includes aprofile processing module which estimates each user's interest invarious target objects by reference to the users' target profileinterest summaries, for example by comparing the target profiles ofthese target objects against the search profiles in users' searchprofile sets, and generates for each user a customized rank-orderedlisting of target objects most likely to be of interest to that user.Each user's target profile interest summary is automatically updated ona continuing basis to, reflect the user's changing interests.

Target objects may be of various sorts, and it is sometimes advantageousto use a single system that delivers and/or clusters target objects ofseveral distinct sorts at once, in a unified framework. For example,users who exhibit a strong interest in certain novels may also show aninterest in certain movies, presumably of a similar nature. A system inwhich some target objects are novels and other target objects are moviescan discover such a correlation and exploit it in order to groupparticular novels with particular movies, e.g., for clustering purposes,or to recommend the movies to a user who has demonstrated interest inthe novels. Similarly, if users who exhibit an interest in certain WorldWide Web sites also exhibit an interest in certain products, the systemcan match the products with the sites and thereby recommend to themarketers of those products that they place advertisements at thosesites, e.g., in the form of hypertext links to their own sites.

The ability to measure the similarity of profiles describing targetobjects and a user's interests can be applied in two basic ways:filtering and browsing. Filtering is useful when large numbers of targetobjects are described in the electronic media s pace. These targetobjects can for example be articles that are received or potentiallyreceived by a user, who only has time to read a small fraction of them.For example, one might potentially receive all items on the AP news wireservice, all items posted to a number of news groups, all advertisementsin a set of newspapers, or all unsolicited electronic mail, but fewpeople have the time or inclination to read so many articles. Afiltering system in the system for customized electronic identificationof, desirable objects automatically selects a set of articles that theuser is likely to wish to read. The accuracy of this filtering systemimproves over time by noting which articles the user reads and bygenerating a measurement of the depth to which the user reads eacharticle. This information is then used to update the user's targetprofile interest summary. Browsing provides an alternate method ofselecting a small subset of a large number of target objects, such asarticles. Articles are organized so that users can actively navigateamong groups of articles by moving from one group to a larger, moregeneral group, to a smaller, more specific group, or to a closelyrelated group. Each individual article forms a one-member group of itsown, so that the user can navigate to and from individual articles aswell as larger groups. The methods used by the system for customizedelectronic identification of desirable objects allow articles to begrouped into clusters and the clusters to be grouped and merged intolarger and larger clusters. These hierarchies of clusters then form thebasis for menuing and navigational systems to allow the rapid searchingof large numbers of articles. This same clustering technique isapplicable to any type of target objects that can be profiled on theelectronic media.

There are a number of variations on the theme of developing and usingprofiles for article retrieval, with the basic implementation of anon-line news clipping service representing the preferred embodiment ofthe invention. Variations of this basic system are disclosed andcomprise a system to filter electronic mail, an extension for retrievalof target objects such as purchasable items which may have more complexdescriptions, a system to automatically build and alter menuing systemsfor browsing and searching through large numbers of target objects, anda system to construct virtual communities of people with commoninterests. These intelligent filters and browsers are necessary toprovide a truly passive, intelligent system interface. A user interfacethat permits intuitive browsing and filtering represents for the firsttime an intelligent system for determining the affinities between usersand target objects. The detailed, comprehensive target profiles anduser-specific target profile interest summaries enable the system toprovide responsive routing of specific queries for user informationaccess. The information maps so produced and the application of users'target profile interest summaries to predict the information consumptionpatterns of a user allows for pre-caching of data at locations on thedata communication network and at times that minimize the traffic flowin the communication network to thereby efficiently provide the desiredinformation to the user and/or conserve valuable storage space by onlystoring those target objects (or segments thereof) which are relevant tothe user's interests.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 illustrates in block diagram form a typical architecture of anelectronic media system in which the system for customized electronicidentification of desirable objects of the present invention can beimplemented as part of a user server system;

FIG. 2 illustrates in block diagram form one embodiment of the systemfor customized electronic identification of desirable objects;

FIGS. 3 and 4 illustrate typical network trees;

FIG. 5 illustrates in flow diagram form a method for automaticallygenerating article profiles and an associated hierarchical menu system;

FIGS. 6-9 illustrate examples of menu generating process,

FIG. 10 illustrates in flow diagram form the operational steps taken bythe system for customized electronic identification of desirable objectsto screen articles for a user;

FIG. 11 illustrates a hierarchical cluster tree example;

FIG. 12 illustrates in flow diagram form the process for determinationof likelihood of interest by a specific user in a selected targetobject,

FIGS. 13A-B illustrate in flow diagram form the automatic clusteringprocess;

FIG. 14 illustrates in flow diagram form the use of the pseudonymousserver;

FIG. 15 illustrates in flow diagram form the use of the system foraccessing information in response to a user query; and

FIG. 16 illustrates in flow diagram form the use of the system foraccessing information in response to a user query when the system is adistributed network implementation.

DETAILED DESCRIPTION MEASURING SIMILARITY

This section describes a general procedure for automatically measuringthe similarity between two target objects, or, more precisely, betweentarget profiles that are automatically generated for each of the twotarget objects. This similarity determination process is applicable totarget objects in a wide variety of contexts. Target objects beingcompared can be, as an example but not limited to: textual documents,human beings, movies, or mutual funds. It is assumed that the targetprofiles which describe the target objects are stored at one or morelocations in a data communication network on data storage mediaassociated with a computer system. The computed similarity measurementsserve as input to additional processes, which function to enable humanusers to locate desired target objects using a large computer system.These additional processes estimate a human user's interest in varioustarget objects, or else cluster a plurality of target objects in tologically coherent groups. The methods used by these additionalprocesses might in principle be implemented on either a single computeror on a computer network. Jointly or separately, they form theunderpinning for various sorts of database systems and informationretrieval systems.

Target Obiects and Attributes

In classical Information Retrieval (IR) technology, the user is aliterate human and the target objects in question are textual documentsstored on data storage devices interconnected to the user via a computernetwork. That is, the target objects consist entirely of text, and soare digitally stored on the data storage devices within the computernetwork. However, there are other target object domains that presentrelated retrieval problems that are not capable of being solved bypresent information retrieval technology which are applicable totargeting of articles and advertisements to readers of an on-linenewspaper:

(a.) the user is a film buff and the target objects are movies availableon videotape.

(b.) the user is a consumer and the target objects are used cars beingsold.

(c.) the user is a consumer and the target objects are products beingsold through promotional deals.

(d.) the user is an investor and the target objects are publicly tradedstocks, mutual funds and/or real estate properties.

(e.) the user is a student and the target objects are classes beingoffered.

(f.) the user is an activist and the target objects are Congressionalbills of potential concern.

(g.) the user is a net-surfer and the target objects are links to pages,servers, or news groups available on the World Wide Web which are linkedfrom pages and articles on-line newspaper.

(h.) the user is a philanthropist and the target objects are charities.

(i.) the user is ill and the target objects are ads for medicalspecialists.

(j.) the user is an employee and the target objects are classifieds forpotential employers.

(k.) the user is an employer and the target objects are classifieds forpotential employees.

(l.) the user is a lonely heart and the target objects are classifiesfor potential conversation partners.

(m.) the user is in search of an expert and the target objects areusers, with known retrieval habits, of an document retrieval system.

(n.) the user is in need of insurance and the target objects areclassifieds for insurance policy offers.

In all these cases, the user wishes to locate some small subset of thetarget objects—such as the target objects that the user most desires torent, buy, investigate, meet, read, give mammograms to, insure, and soforth. The task is to help the, user identify the most interestingtarget objects, where the user's interest in a target object is definedto be a numerical measurement of the user's relative desire to locatethat object rather than others.

The generality of this problem motivates a general approach to solvingthe information retrieval problems noted above. It is assumed that manytarget objects are known to the system for customized electronicidentification of desirable objects, and that specifically, the systemstores (or has the ability to reconstruct) several pieces of informationabout each target object. These pieces of information are termed“attributes”: collectively, they are said to form a profile of thetarget object, or a “target profile.” For example, where the system forcustomized electronic identification of desirable objects is activatedto identify selection of interest, a particular category of on-lineproducts for review or purchase by the user, it can be appreciated thatthere are certain unique sets of attributes which are pertinent to theparticular product category of choice. For the application as part of amovie critic column (where the system identifies movie titles andreviews which are most interesting to the users), the system is likelyto be concerned with values of attributes such as these:

(a.) title of movie,

(b.) name of director,

(c.) Motion Picture Association of America (MPAA) child-appropriatenessrating

(0G, 1=PG, . . . ),

(d.) date of release,

(e.) number of stars granted by a particular critic,

(f.) number of stars granted by a second critic,

(g.) number of stars granted by a third critic,

For example, a customized financial news column may be presented to the,user in the form of articles which are of interest to the user. In thiscase, however, an accordingly those stocks which are most interesting tothe user may be presented as well.

(h.). full text of review by the third critic,

(i.) list of customers who have previously rented this movie,

(j.) list of actors.

Each movie has a different set of values for these attributes. Thisexample conveniently illustrates three kinds of attributes. Attributesc-g are numeric attributes, of the sort that might be found in adatabase record. It is evident that they can be used to help the useridentify target objects (movies)-of interest. For example, the usermight previously have rented many Parental Guidance (PG) films, and manyfilms made in the 1970's. This generalization is useful: new films withvalues for one or both attributes that are numerically similar to these(such as MPAA rating of 1, release date of 1975) are judged similar tothe films the user already likes, and therefore of probable interest.Attributes a-b and h are textual attributes. They too are important forhelping the user locate desired films. For example, perhaps the user hasshown a past interest in films whose review text (attribute h) containswords like “chase,” “explosion,” “explosions,” “hero,” “gripping,” and“superb.” This generalization is again useful in identifying new filmsof interest. Attribute i is an associative attribute. It recordsassociations between the target objects in this domain, namely movies,and ancillary target objects of an entirely different sort, namelyhumans. A good indication that the user wants to rent a particular movieis that the user has previously rented other movies with similarattribute values, and this holds for attribute I just as it does forattributes a-h. For example, if the user has often liked movies thatcustomer C₁₇ and customer C₁₉₀ have rented, then the user may like othersuch movies, which have similar values for attribute i. Attribute j isanother example of an associative attribute, recording associationsbetween target objects and actors. Notice that any of these attributescan be made subject to authenticatton when the profile is constructed,through the use of digital signatures; for example, the target objectcould be accompanied by a digitally signed note from the MPAA, whichnote names the target object and specifies its authentic value forattribute c.

These three kinds of attributes are common: numeric, textual, andassociative. In the classical information retrieval problem, where thetarget objects are documents (or more generally, coherent documentsections extracted by a text segmentation method), the system might onlyconsider a single, textual attribute when measuring similarity: the filltext of the target object. However, a more sophisticated system wouldconsider a longer target profile, including numeric and associativeattributes:

(a.) full text of document (textual),

(b.) title (textual),

(c.) author (textual),

(d.) language in which document is written (textual),

(e.) date of creation (numeric),

(f.) date of last update (numeric),

(g.) length in words (numeric),

(h.) reading level (numeric),

(i.) quality of document as rated by a third\_arty editorial agency(numeric),

(j.) list of other readers who have retrieved this document(associative).

As another domain example, consider a domain where the user is anadvertiser and the target objects are potential customers. The systemmight store the following attributes for each target object (potentialcustomer):

(a.) first two digits of zip code (textual),

(b.) first three digits of zip code (textual),

(c.) entire five-digit zip code (textual),

(d.) distance of residence from advertiser's nearest physical storefront(numeric),

(e.) annual family income (numeric),

(f.) number of children (numeric),

(g.) list of previous items purchased by this potential customer(associative),

(h.) list of filenames stored on this potential customer's clientcomputer (associative),

(i.) list of movies rented by this potential customer (associative),

(j.) list of investments in this potential customer's investmentportfolio (associative),

(k.) list of documents retrieved by this potential customer(associative),

(l.) written response to Rorschach inkblot test (textual),

(m.) multiple-choice responses by this customer to 20 self-imagequestions (20 textual attributes).

As always, the notion is that similar consumers buy similar products. Itshould be noted that diverse: sorts of information are being used hereto characterize consumers, from their consumption patterns to theirliterary taste s and psychological peculiarities, and that this factillustrates both the flexibility and power of the system for customizedelectronic identification of desirable objects of the present invention.Diverse sorts of information can be used as attributes in other domainsas well (as when physical, economic, psychological and interest-relatedquestions are used to profile the applicants to a dating service, whichis indeed a possible domain for the present system), and the advertiserdomain is simply an example.

As a final domain example, consider a domain where the user is an stockmarket investor and the target objects are publicly traded corporations.A great many attributes might be used to characterize each corporation,including but not limited to the following:

(a.) type of business (textual),

(b.) corporate mission statement (textual),

(c.) number of employees during each of the last 10 years (ten separatenumeric attributes),

(d.) percentage growth in number of employees during each of the last 10years,

(e.) dividend payment issued in each of the last 40 quarters, as apercentage of current share price,

(f.) percentage appreciation of stock value during each of the last 40quarters, list of shareholders (associative),

(g.) composite text of recent articles about the corporation in thefinancial press (textual).

It is worth noting some additional attributes that are of interest insome domnains. In the case of documents and certain other domains, it isuseful to know the source of each target object (for example, refereedjournal article vs. UPI news wire article vs. Usenet newsgroup postingvs. question-answer pair from a question-and-answer list vs. tabloidnewspaper article vs. . . . ); the source may be represented as asingle-term textual attribute. Important associative attributes for ahypertext document are the list of documents that it links to, and thelist of documents that link to it. Documents with similar citations aresimilar with respect to the former attribute, and documents that arecited in the same places are similar with respect to the latter. Aconvention may optionally be adopted that any document also links toitself. Especially in systems where users can choose whether or not toretrieve a target object, a target object's popularity (or circulation)can be usefully measured as a numeric attribute specifying the number ofusers who have retrieved that object. Related measurable numericattributes that also indicate a kind of popularity include the number ofreplies to a target object, in the domain where target objects aremessages posted to an electronic community such as an computer bulletinboard or newsgroup, and the number of links leading to a target object,in the domain where target objects are interlinked hypertext documentson the World Wide Web or a similar system. A target object may alsoreceive explicit numeric evaluations (another kind of numeric attribute)from various groups, such as the Motion Picture-Association of America(MPAA), as above, which rates movies' appropriateness for children, orthe American Medical Association, which might rate the accuracy andnovelty of medical research papers, or a random survey sample of users(chosen from all users or a selected set of experts), who could be askedto rate nearly anything. Certain other types of evaluation, which alsoyield numeric attributes, may be carried out mechanically. For example,the difficulty of reading a text can be assessed by standard proceduresthat count word and sentence lengths, while the vulgarity of a textcould be defined as (say) the number of vulgar words it contains, andthe expertise of a text could be crudely assessed by counting the numberof similar texts its author had previously retrieved and read using theinvention, perhaps confining this count to texts that have high approvalratings from critics. Finally, it is possible to synthesize certaintextual attributes mechanically, for example to reconstruct the scriptof a movie by applying speech recognition techniques to its soundtrackor by applying optical character recognition techniques to itsclosed-caption subtitles.

Decomposing Complex Attributes

Although textual and associative attributes are large and complex piecesof data, for information retrieval purposes they can be decomposed intosmaller, simpler numeric attributes. This means that any set ofattributes can be replaced by a (usually larger) set of numericattributes, and hence that any profile can be represented as a vector ofnumbers denoting the values of these numeric attributes. In particular,a textual attribute, such as the fill text of a movie review, can bereplaced by a collection of numeric attributes that represent scores todenote the presence and significance of the words “aardvark,” “aback,”“abacus,” and so on through “zymurgy” in that text. The score of a wordin a text may be defined in numerous ways. The simplest definition isthat the score is the rate of the word in the text, which is computed bycomputing the number of times the word occurs in the text, an d dividingthis number by the total number of words in the text. This sort of scoreis often called the “term frequency” (TF) of the word. The definition ofterm frequency may optionally be modified to weight different portionsof the text unequally: for example, any occurrence of a word in thetext's title might be counted as a 3-fold or more generally k-foldoccurrence (as if the title had been repeated k times within the text),in order to reflect a heuristic assumption that the words in the titleare particularly important indicators of the text's content or topic.

However, for lengthy textual attributes, such as the text of an entiredocument, the score of a word is typically defined to be not merely itsterm frequency, but its term frequency multiplied by the negatedlogarithm of the word's “global frequency,” as measured with respect tothe textual attribute in question. The global frequency of a word, whicheffectively measures the word's uninformativeness, is a fraction between0 and 1, defined to be the fraction of all target objects for which thetextual attribute in question contains this word. This adjusted score isoften known in the art as TF/IDF (“term frequency times inverse documentfrequency”). When global frequency of a word is taken into account inthis way, the common, uninformative words have scores comparativelyclose to zero, no matter how often or rarely they appear in the text.Thus, their rate has little influence on the object's target profile.Alternative methods of calculating word scores include latent semanticindexing or probabilistic models.

Instead of breaking the text into its component words, one couldalternatively break the text into overlapping word bigrams (sequences of2 adjacent words), or more generally, word n-grams. These word n-gramsmay be scored in the same way as individual words. Another possibilityis to use character n-grams. For example, this sentence contains asequence of overlapping character 5-grams which starts “for e”, “or ex”,“r exa”, “exam”, “examp”, etc. The sentence may be characterized,imprecisely but usefully, by the score of each possible character 5-gram(“aaaaa”, “aaaab”, “zzzzz”) in the sentence. Conceptually speaking, inthe character 5-gram case, the textual attribute would be decomposedinto at least 26⁵=11,881,376 numeric attributes. Of course, for a giventarget object, most of these numeric attributes have values of 0, sincemost 5-grams do not appear in the target object attributes. These zerovalues need not be stored anywhere. For purposes of digital storage, thevalue of a textual attribute could be characterized by storing the setof character 5-grams that actually do appear in the text, together withthe nonzero score of each one. Any 5-gram that is no t included in theset can be assumed to have a score of zero. The decomposition of textualattributes is not limited to attributes whose values are expected to belong texts. A simple, one-term textual attribute can be replaced by acollection of numeric attributes in exactly the same way. Consider againthe case where the target objects are movies. The “name of director”attribute, which is textual, can be replaced by numeric attributesgiving the scores for “Federico-Fellini,” “Woody-Allen,”“Terence-Davies,” and so forth, in that attribute. For these one-termtextual attributes, the score of a word is usually defined to be itsrate in the text, without any consideration of global frequency. Notethat under these conditions, one of the scores is 1, while the otherscores are 0 and need not be stored. For example, if Davies did directthe film, then it is “Terence-Davies” whose score is 1, since“Terence-Davies” constitutes 100% of the words in the textual value ofthe “name of director” attribute. It might seem that nothing has beengained over simply regarding the textual attribute as having the stringvalue “Terence-Davies.” However, the trick of decomposing everynon-numeric attribute into a collection of numeric attributes provesusefull for the clustering and decision tree methods described later,which require the attribute values of different objects to be averagedand/or ordinally ranked. Only numeric attributes can be averaged orranked in this way.

Just as a textual attribute may be decomposed into a number of componentterms (letter or word n-grams), an associative attribute may bedecomposed into a number of component associations. For instance, in adomain where the target objects are movies, a typical associativeattribute used in profiling a movie would be a list of customers whohave rented that movie. This list, can be replaced by a collection ofnumeric attributes, which give the “association scores” between themovie and each of the customers known to the system. For example, the165th such numeric attribute would be the association score between themovie and customer #165, where the association score is defined to be 1if customer #165 has previously rented the movie, and. 0 otherwise. In asubtler refinement, this association s core could be defined to be thedegree of interest, possibly zero, that customer #165 exhibited in themovie, as determined by relevance feedback (as described below). Asanother example, in a domain where tar get objects are companies, anassociative attribute indicating the major shareholders of the companywould be decomposed into a collection of association scores, each ofwhich would indicate the percentage of the company (possibly zero) ownedby some particular individual or corporate body. Just as with the termscores used in decomposing lengthy textual attributes, each associationscore may optionally be adjusted by a multiplicative factor: forexample, the association score between a movie and customer #165 mightbe multiplied by the negated logarithm of the “global frequency” ofcustomer #165, i.e., the fraction of all movies that have been rented bycustomer #165. Just as with the term scores used in decomposing textualattributes, most association scores found when decomposing a particularvalue of an associative attribute are zero, and a similar economy ofstorage may be gained in exactly the same manner by storing a list ofonly those ancillary objects with which the target object has a nonzeroassociation score, together with their respective association scores.

Similarity Measures

What does it mean for two- target objects to be similar? More precisely,how should one measure the degree of siminlarity? Many approaches arepossible and any reasonable metric that can be computed over the set oftarget object profiles can be used, where target objects are consideredto be similar if the distance between their profiles is small accordingto this metric. Thus, the following preferred embodiment of a targetobject similarity measurement system has m any variations.

First, define the distance between two values of a given attributeaccording to whether the attribute is a numeric, associative, or textualattribute. If the attribute is numeric, then the distance between twovalues of the attribute is the absolute value of the difference betweenthe two values. (Other definitions are also possible: for example, thedistance between prices p1 and p2 might be defined by|(p1−p2)|/(max(p1,p2)+1), to recognize that when it comes to customerinterest, $5000 and $5020 are very similar, whereas $3 and $23 are not.)If the attribute is associative, then its value V may be decomposed asdescribed above into a collection of real numbers, representing theassociation scores between the target object in question and variousancillary objects. V may therefore be regarded as a vector withcomponents V₁, V₂, V₃, etc., representing the association scores betweenthe object and ancillary objects 1, 2, 3, etc., respectively. Thedistance between two vector values V and U of an associative attributeis then computed using the angle distance measure, arccos(VU^(t)/sqrt((Vv^(t)v)(UU^(t)))). (Note that the three inner products inthis expression have the form XY^(t)=X₁ Y₁+X₂ Y₂+X₃ Y₃+ . . . , and thatfor efficient computation, terms of the form X_(i) Y_(i) may be omittedfrom this sum if either of the scores X_(i) and Y_(i) is zero.) Finally,if the attribute is textual, then its value V may be decomposed asdescribed above into a collection of real numbers, representing thescores of various word n-grams or character n-grams in the text. Thenthe value V may again be regarded as a vector, and the distance betweentwo values is again defined via the angle distance measure. Othersimilarity metrics between two vectors, such as the dice measure, may beused instead. It happens that the obvious alternative metric, Euclideandistance, does not work well: even similar texts tend not to overlapsubstantially in the content words they use, so that texts encounteredin practice are all substantially orthogonal to each other, assumingthat TF/IDF scores are used to reduce the influence of non-contentwords. The scores of two words in a textual attribute vector may becorrelated; for example, “Kennedy” and “JFK” tend to appear in the samedocuments.

Thus it may be advisable to alter the text somewhat before computing thescores of terms in the text, by using a synonym dictionary that groupstogether similar words. The effect of this optional pre-alteration isthat two texts using related words are measured to be as similar as ifthey had actually used the same words. One technique is to augment theset of words actually found in the article with a set of synonyms orother words which tend to co-occur with the words in the article, sothat “Kennedy” could be added to every article that mentions “JFK.”Alternatively, words found in the article may be wholly replaced bysynonyms, so that “JFK” might be replaced by “Kennedy” or by “John F.Kennedy” wherever it appears. In either case, the result is thatdocuments about Kennedy and documents about JFK are adjudged similar.The synonym dictionary may be sensitive to the topic of the document asa whole; for example, it may recognize that “crane” is likely to have adifferent synonym in a document that mentions birds than in a documentthat mentions construction. A related technique is to replace each wordby its morphological stem, so that “staple”, “stapler”, and “staples”are all replaced by “staple.” Common function words (“a”, “and”, “the” .. . ) c an influence the calculated similarity of texts without regardto their topics, and so are typically removed from the text before thescores of terms in the text are computed. A more general approach torecognizing synonyms is to use a revised measure of the distance betweentextual attribute vectors V and U, namely arccos(AV(AU)^(t)/sqrt(AV(AV)^(t) AU(AU)^(t)), where the matrix A is thedimensionality-reducing linear transformation (or an approximationthereto) determined by collecting the vector values of the textualattribute, for all target objects known to the system, and applyingsingular value decomposition to the resulting collection. The sameapproach can be applied to the vector values of associative attributes.The above definitions allow us to determine how close together twotarget objects are with respect to a single attribute, whether numeric,associative, or textual. The distance between two target objects X and Ywith respect to their entire multi-attribute profiles P_(X) and P_(Y) isthen denoted d(X,Y) or d(P_(X), P_(Y)) and defined as:

(((distance with respect to attribute a)(weight of attributea))^(k)+((distance with respect to attribute b)(weight of attributeb))^(k)+((distance with respect to attribute c)(weight of attributec))^(k)+ . . . )^(k)

where k is a fixed positive real number, typically 2, and the weightsare non-negative real numbers indicating the relative importance of thevarious attributes. For example, if the target objects are consumergoods, and the weight of the “color” attribute is comparatively verysmall, then price is not a consideration in determining similarity: auser who likes a brown massage cushion is predicted to show equalinterest in the same cushion manufactured in blue, and vice-versa. Onthe other hand, if the weight of the “color” attribute is comparativelyvery high, then users are predicted to show interest primarily inproducts whose colors they have liked in the past: a brown massagecushion and a blue massage cushion are not at all the same kind oftarget object, however similar in other attributes, and a goodexperience with one does not by itself inspire much interest in theother. Target objects may be of various sorts, and it is sometimesadvantageous to use a single system that is able to compare tar getobjects of distinct sorts. For example, in a system where some targetobjects are novels while other target objects are movies, it isdesirable to judge a novel and a:movie similar if their profiles showthat similar users like them (an associative attribute). However, it isimportant to note that certain attributes specified in the movie'starget profile are undefined in the novel's target profile, and viceversa: a novel has no “cast list” associative attribute and a movie hasno “reading level” numeric attribute. In general, a system in whichtarget objects fall into distinct sorts may sometimes have to measurethe similarity of two target objects for which somewhat different setsof attributes are defined. This requires an extension to the distancemetric d(*,*) defined above. In certain applications, it is sufficientwhen carrying out such a comparison simply to disregard attributes thatare not defined for both target objects: this allows a cluster of novelsto be matched with the most similar cluster of movies, for example, byconsidering only those attributes that novels and movies have in common.

However, while this method allows comparisons between (say) novels andmovies, it does not define a proper metric over the combined space ofnovel s and movies and therefore does not allow clustering to be appliedto the set of all target objects. When necessary for clustering or otherpurposes, a metric that allows comparison of any two target objects(whether of the same or different sorts) can b e defined as follows. Ifa is an attribute, then let Max(a) be an upper bound on the distancebetween two values of attribute a; notice that if attribute a is anassociative or textual attribute, this distance is an angle determinedby arccos, so that Max(a) may be chosen to be 180 degrees, while ifattribute a is a numeric attribute, a sufficiently large number must beselected by the system designers. The distance between two values ofattribute a is given as before in the case where both values aredefined; the distance between two undefined values is taken to be zero;finally, the distance between a defined value and an undefined value isalways taken to be Max(a)/2. This allows us to determine how closetogether two target objects are with respect to an attribute a, even ifattribute a does not have a defined value for both target objects. Thedistance d(*,*) between two target objects with respect to their entiremulti-attribute profiles is then given in terms of these individualattribute distances exactly as before. It is assumed that one attributein such a system specifies the sort of target object (“movie”, “novel”,etc.), and that this attribute may be highly weighted if target objectsof different sorts are considered to be very different despite anyattributes they may have in common.

UTILIZING THE SIMILARITY MEASUREMENT

Matching Buyers and Sellers

A simple application of the similarity measurement is a system to matchbuyers with sellers in small-volume markets, such as used cars and otherused goods, artwork, or employment. Sellers submit profiles of the goods(target objects) they want to sell, and buyers submit, profiles of thegoods (target objects) they want to buy. Participants may submit orwithdraw these profiles at any time. The system for customizedelectronic identification of desirable objects computes the similaritiesbetween seller-submitted profiles and buyer-submitted profiles, and whentwo profiles match closely (i.e., the similarity is above a threshold),the corresponding seller and buyer are notified of each other'sidentities. To prevent users from being flooded with responses, it maybe desirable to limit the number of notifications each user receives toa fixed number, such as ten per day.

Filtering: Relevance Feedback

A filtering system is a device that can search through many targetobjects and estimate a given user's interest in each target object, soas to identify those that are of greatest interest to the user. Thefiltering system uses relevance feed back to refine its knowledge of theuser s interests: whenever the filtering system identifies a targetobject as potentially interesting to a user, the user (if an on-lineuser) provides feedback as to whether or not that target object reallyis of interest. Such feedback is stored long-term in summarized form, aspart of a database of user feedback information, and may be providedeither actively or passively. In active feedback, the user explicitlyindicates his or her interest, for instance, on a scale of −2 (activedistaste) through 0 (no special interest) to 10 (great interest). Inpassive feedback, the system infers the user's interest from the user'sbehavior. For example, if target objects are textual documents, thesystem might monitor which documents the user chooses to read, or not toread, and how much time the user spends reading them. A typical formulafor assessing interest in a document via passive feedback, in thisdomain, on a scale of 0 to 10, might be:

+2 if the second: page is viewed,

+2 if all pages are viewed,

+2 if more than 30 seconds was spent viewing the document,

+2 if more-than one minute was spent viewing the document,

+2 if the minutes spent viewing the document are greater than half thenumber of pages.

If the target objects are electronic mail messages, interest pointsmight also be added in the case of a particularly lengthy orparticularly prompt reply. If the target objects are purchasable goods,interest points might be added for target objects that the user actuallypurchases, with further points in the case of a large-quantity orhigh-price purchase. In any domain, further points might be added fortarget objects that the user accesses early in a session, on the groundsthat users access the object s that most interest them first. Otherpotential sources of passive feedback include an electronic measurementof the extent to which the user's pupils dilate while the user views thetarget object or a description of the target object. It is possible tocombine active and passive feedback. One option is to take a weightedaverage of the two ratings. Another option is to use passive feedback bydefault, but to allow the user to examine and actively modify thepassive feedback score. In the scenario above, for instance, anuninteresting article may sometimes remain on the display device for along period while the user is engaged in unrelated business; the passivefeedback score, is then inappropriately high, and the user may wish tocorrect it before continuing. In the preferred embodiment of theinvention, a visual indicator, such as a sliding bar or indicator needleon the user's screen, can be used is to continuously display the passivefeedback score estimated by the system for the target object beingviewed, unless the user has manually adjusted the indicator by a mouseoperation or other means in order to reflect a different score for thistarget object, after which the indicator displays the active feedbackscore selected by the user, and this active feedback score is used bythe system instead of the passive feedback score. In a variation, theuser cannot see or adjust the indicator until just after the user hasfinished viewing the target object. Regardless how a user's feedback iscomputed, it is stored long-term as part of that user's target profileinterest summary.

Filtering: Determining Topical Interest Through Similarity

Relevance feedback only determines the user's' interest in certaintarget objects: namely, the target objects that the user has actuallyhad the opportunity to evaluate (whether actively or passively). Fortarget objects that the user has not yet seen, the filtering system mustestimate the user's interest. This estimation task is the heart of thefiltering problem, and the reason that the similarity measurement isimportant. More concretely, the preferred embodiment of the filteringsystem is a news clipping service that periodically presents the userwith news articles of potential interest. The user provides activeand/or passive feedback to the system relating to these presentedarticles. However, the system does not have feedback information fromthe user for articles that have never been presented to the user, suchas new articles that have just been added to the database, or oldarticles that the system chose not to present to the user. Similarly, inthe dating service domain where target objects are prospective romanticpartners, the system has only received feedback on old flames, not onprospective new loves.

As shown in flow diagram form in FIG. 12, the, evaluation of thelikelihood of interest in a particular target object for a specific usercan automatically be computed. The interest that a given target object Xholds for a user U is assumed to be a sum of two quantities: q(U, X),the intrinsic “quality” of X plus f(U, X), the “topical interest” thatusers like U have in target objects like X. For any target object X, theintrinsic quality measure q(U, X) is easily estimated at steps 1201-1203directly from numeric attributes of the target object X. The computationprocess begins at step 1201, where certain designated numeric attributesof target object X are specifically selected, which attributes by theirvery nature should be positively or negatively correlated with users'interest. Such attributes, termed “quality attributes,” have thenormative property that the higher (or in some cases lower) their value,the more interesting a user is expected to find them. Quality attributesof target object X may include, but are not limited to, target objectX's popularity among users in general, the rating a particular reviewerhas given target object X, the age (time since authorship—also known asoutdatedness) of target object X, the number of vulgar words used intarget object X, the price of target object X, and the amount of moneythat the company selling target object X has donated to the user'sfavorite charity. At step 1202, each of the selected attributes ismultiplied by a positive or negative weight indicative of the strengthof user U's preference for those target objects that have high valuesfor this attribute, which weight must be retrieved from a data filestoring quality attribute weights for the selected user. At step 1203, aweighted sum of the identified weighted selected attributes is computedto determine the intrinsic quality measure q(U X). At step 1204, thesummarized weighted relevance feedback data is retrieved, wherein somerelevance feedback points are weighted more heavily than others and thestored relevance data can be summarized to some degree, for example bythe use of search profile sets. The more difficult part of determininguser U's interest in target object X is to find or compute at step 1205the value of f(U, X), which denotes the topical interest that users likeU generally have in target objects like X. The method of determining auser's interest relies on the following heuristic: when X and Y aresimilar target objects (have similar attributes), and U and V aresimilar users (have similar attributes), then topical interest f(U, X)is predicted to have a similar value to the value of topical interestq(V, Y). This heuristic leads to an effective method because estimatedvalues of the topical interest function f(*, *) are actually know n forcertain arguments to that function: specifically, if user V has provideda relevance-feedback rating of r(V, Y) for target object Y then insofaras that rating represents user V's true interest in target object Y, wehave r(V, Y)=q(V, Y)+f(V, Y) and can estimate f(V, Y) as r(V, Y)−q(V,Y). Thus, the problem of estimating topical interest at all pointsbecomes a problem of interpolating among these estimates of topicalinterest at selected points, such as the feedback estimate of f(V, Y) as r(V, Y)−q(V, Y). This interpolation can be accomplished with anystandard smoothing technique, using as input the known point estimatesof the value of the topical interest function f(*, *), and determiningas output a function that approximates the entire topical interestfunction f(*, *).

Not all point estimates of the topical interest function f(*, *) shouldbe given equal weight as inputs to the smoothing algorithm. Sincepassive relevance feedback is less reliable than active relevancefeedback, point estimates made from passive relevance feedback should beweighted less heavily than point estimates made from active relevancefeedback, or even not used at all. In most domains, a user's interestsmay change over time and, therefore, estimates of topic al interest thatderive from more recent feedback should also be weighted more heavily. Auser's interests may vary according to mood, so estimates of topicalinterest that derive from the current session should be weighted moreheavily for the duration of the current session, and past estimates oftopical interest made at approximately the current time of day or on thecurrent weekday should be weighted more heavily. Finally, in domainswhere users are trying to locate target objects of long-term interest(investments, romantic partners, pen pals, employers, employees,suppliers, service providers) from the possibly meager informationprovided by the target profiles, the users are usually not in a positionto provide reliable immediate feedback on a target object, but canprovide reliable feedback at a later date. An estimate of topicalinterest f(V, Y) should be weighted more heavily if user V has had moreexperience with a target object Y. Indeed, a useful strategy is for thesystem to track long-term feedback for such target objects. For example,if target profile Y was created in 1990 to describe a particularinvestment that was available in 1990, and that was purchased in 1990 byuser V, then the system solicits relevance feedback from user V in theyears 1990, 1991, 1992, 1993, 1994, 1995, etc., and treats these assuccessively stronger indications of user V's true interest in targetprofile Y, and thus as indications of user V's likely interest in newinvestments whose current profiles resemble the original 1990 investmentprofile Y. In particular, if in 1994 and 1995 user V is well-disposedtoward his or her 1990 purchase of the investment described by targetprofile Y, then in those years and later, the system tends to recommendadditional investments when they have profiles like target profile Y, onthe grounds that they too will turn out to be satisfactory in 4 to 5years. It makes these recommendations both to user V and to users whoseinvestment portfolios and other attributes are similar to user V's. Therelevance feedback provided by user V in this case may be either active(feedback satisfaction ratings provided by the investor V) or passive(feedback=difference between average annual return of the investment andaverage annual return of the Dow Jones index portfolio since purchase ofthe investment, for example).

To effectively apply the smoothing technique, it is necessary to have adefinition of the similarity distance between (U, X) and (V, Y), for anyusers U and V and any target objects X and Y. We have already seen howto define the distance d(X, Y) between two target objects X and Y, giventheir attributes. We may regard a pair such as (U. X) as an extendedobject that bears all the attributes of target X and all the attributesof user U; then the distance between (U, X) and (V, Y) may be computedin exactly the same way. This approach requires user U, user V, and allother users to have some attributes of their own stored in the system:for example, age (numeric), social security number (textual), and listof documents previously retrieved (associative). It is these attributesthat determine the notion of “similar users.” Thus it is desirable togenerate profiles of users (termed “user profiles”) as well as profilesof target objects (termed “target profiles”). Some attributes employedfor profiling users may be related to the attributes employed forprofiling target objects: for example, using associative attributes, itis possible to characterize target objects such as X by the interestthat various users have shown in them, and simultaneously tocharacterize users such as U by the interest that they have shown invarious target objects. In addition, user profiles may make use of anyattributes that are usefull in characterizing humans, such as thosesuggested in the example domain above where target objects are potentialconsumers. Notice that user U's interest can be estimated even if user Uis a new user or an off-line user who has never provided any feedback,because the relevance feedback of users whose attributes are similar toU's attributes is taken into account.

For some uses of filtering systems, when estimating topical interest, itis appropriate to make an additional “presumption of no topicalinterest” (or “bias toward zero”). To understand the usefulness of sucha presumption, suppose the system needs to determine whether targetobject X is topically interesting to the user U, but that users likeuser U have never provided feedback on target objects even remotely liketarget object X. The presumption of no topical interest says that ifthis is so, it is because users like user U are simply not interested insuch target objects and therefore do not seek them out and interact withthem. On this presumption, the system should estimate topical interestf(U, X) to be low. Formally, this example has the characteristic that(U, X) is far away from all the points (V, Y) where feedback isavailable. In such a case, topical interest f(U, X) is presumed to beclose to zero, even if the value of the topical interest function f(*,*)is high at all the faraway surrounding points at which its value isknown. When a smoothing technique is used, such a presumption of notopical interest can be introduced, if appropriate, by manipulating theinput to the smoothing technique. In addition to using observed valuesof the topical interest: function f(*, *) as input, the trick is ,toalso introduce fake observations of the form topical interest f(V, Y)=0for a lattice of points (V, Y) distributed throughout themultidimensional space. These fake observations should be givenrelatively low weight as inputs to the smoothing algorithm. The morestrongly they are weighted, the stronger the presumption of no interest.

The following provides another simple example of an estimation techniquethat has a presumption of no interest. Let g be a decreasing functionfrom non-negative real numbers to non-negative real numbers, such asg(x)=e^(x) or g(x)=min(1, x^(−k)) where k>1. Estimate topical interestf(U, X), with the following g-weighted average:${f\left( {U,X} \right)} = \frac{\sum\quad \left( {\left( {{r\left( {V,Y} \right)} - {q\left( {V,Y} \right)}} \right)*{g\left( {{{distance}\quad \left( {U,X} \right)}\left( {V,Y} \right)} \right)}} \right.}{\sum{g\left( {{{distance}\left( {U,V} \right)}\left( {V,Y} \right)} \right)}}$

Here the summations are over all pairs (V, Y) such that user V hasprovided feedback r(V, Y) on target object Y i.e., all pairs (V, Y) suchthat relevance feedback r(V, Y) is defined. Note that both with thistechnique and with conventional smoothing techniques, the estimate ofthe topical interest f(U, X) is not necessarily equal to r(U, X)q(U, X),even when r(U, X) is defined.

Filtering: Adjusting Weights and Residue Feedback

The method described above requires the filtering system to measuredistances between (user, target object) pairs, such as the distancebetween (U, X) and (V, Y). Given the means described earlier formeasuring the distance between two multi-attribute profiles, the methodmust therefore associate a weight with each attribute used in theprofile of (user, target object) pairs, that is, with each attributeused to profile either users or target objects. These weights specifythe relative importance of the attributes in establishing similarity ordifference, and therefore, in determining how topical interest isgeneralized from one (user, target object) pair to another. Additionalweights determine which attributes of a target object contribute to thequality function q, and by how much.

It is possible and often desirable for a filtering system to store adifferent set of weights for each user. For example, a user who thinksof two-star films as having materially different topic and style fromfour-star films wants to assign a high weight to “number of stars” forpurposes of the similarity distance measure d(*, *); this means thatinterest in a two-star film does not necessarily signal interest in anotherwise similar four-star film, or vice-versa. If the user also agreeswith the critics, and actually prefers four-star films, the user alsowants to assign “number of stars” a high positive weight in thedetermination of the quality function q. In the same way, a user whodislikes vulgarity wants to assign the “vulgarity score” attribute ahigh negative weight in the determination of the quality function q,although the “vulgarity score” attribute does not necessarily have ahigh weight in determining the topical similarity of two films.

Attribute weights (of both sorts) may be set or adjusted by the systemadministrator or the individual user, on either a temporary or apermanent basis. However, it is often desirable for the filtering systemto learn attribute weights automatically, based on relevance feedback.The optimal attribute weights for a user U are those that allow the mostaccurate prediction of user U's interests. That is, with the distancemeasure and quality function defined by these attribute weights, userU's interest in target object X, q(U, X)+f(U, X), can be accuratelyestimated by the techniques above. The effectiveness of a particular setof attribute weights for user U can therefore be gauged by seeing howwell it predicts user Us known interests.

Formally, suppose that user U has previously provided feedback on targetobjects X₁, X₂, X₃, . . . X_(n), and that the feedback ratings are r(U,X₁), r(U, X₂), r(U, X₃), . . . r(U, X_(n)). Values of feedback ratingsr(*,*) for other users and other target objects may also be known. Thesystem may use the following procedure to gauge the effectiveness of theset of attribute weights it currently stores for user U: (1) For each1<=I<=n, use the estimation techniques to estimate q(U, X₁)+f(U, X_(i))from all known values of feedback ratings r. Call this estimate a_(i).(ii) Repeat step (i), but this time make the estimate for each 1<=i<=nwithout using the feedback ratings r(U, X_(j)) as input, for any j suchthat the distance d(X_(i), X_(j)) is smaller than a fixed threshold.That is, estimate each q(U, X_(i))+f(U, X_(i)) from other values offeedback rating r only; in particular, do not use r(U, X_(i)) itself.Call this estimate b_(i). The difference a_(i)−b_(i) is herein termedthe “residue feedback r_(res)(U, X_(i)) of user U on target objectX_(i).” (iii) Compute user U's error measure,(a₁−b₁)²+(a₂−b₂)²+(a₃−b₃)²+ . . . +(a_(n)−b_(n))².

A gradient-descent or other numerical optimization method may be used toadjust user U's attribute weights so that this error measure reaches a(local) minimum. This approach tends to work best if the smoothingtechnique used in estimation is such that the value of f(V, Y) isstrongly affected by the point estimate r(V, Y)−q(V, Y) when the lattervalue is provided as input. Otherwise, the presence or absence of thesingle input feedback rating r(U, Xe), in steps (i)-(ii) may not makea_(i) and b_(i) very different from each other. A slight variation ofthis learning technique adjusts a single global set of at tributeweights for all users, by adjusting the weights so as to minimize not aparticular user's error measure but rather the total error measure ofall users. These global weights are used as a default initial settingfor a new user who has not yet provided any feedback. Gradient descentcan then be employed to adjust this user's individual weights over time.

Even when the attribute weights are chosen to minimize the error measurefor user U the error measure is generally still positive, meaning thatresidue feedback from user U has not been reduced to 0 on all targetobjects. It is useful to note that high residue feedback from a user Uon a target object X indicates that user U liked target object Xunexpectedly well given its profile, that is, better than the smoothingmodel could predict from user U's opinions on target objects withsimilar profiles. Similarly, low residue feedback indicates that user Uliked target object X less than was expected. By definition, thisunexplained preference or dispreference cannot be the result of topicalsimilarity, and therefore must be regarded as an indication of theintrinsic quality of target object X. It follows that a useful qualityattribute for a target object X is the average amount of residuefeedback r_(res)(V, X) from users on that target object, averaged overall users V who have provided relevance feedback on the target object.In a variation of this idea, residue feedback is never averagedindiscriminately over all users to form a new attribute, but instead issmoothed to consider users' similarity to each other. Recall that thequality measure q(U, X) depends on the user U as well as the targetobject X, so that a given target object X may be perceived by differentusers to have different quality. In this variation, as before, q(U, X)is calculated as a weighted sum of various quality attributes that aredependent only on X, but then an additional term is added, namely anestimate of r_(res) (U, X) found by applying a smoothing algorithm toknown values of r_(res) (V, X). Here V ranges over all users who haveprovided relevance feedback on target object X, and the smoothingalgorithm is sensitive to the distances d(U, V) from each such user V touser U.

Using the Similarity Computation for Clustering

A method for defining the distance between any pair of target objectswas disclosed above. Given this distance measure, it is simple to applya standard clustering algorithm, such as k-means, to group the targetobjects into a number of clusters, in such a way that similar targetobjects tend to be grouped in the same cluster. It is clear that theresulting clusters can be used to improve the efficiency of matchingbuyers and sellers in the application described in section “MatchingBuyers and Sellers” above: it is not necessary to compare every buyprofile to every sell profile,but only to compare buy profiles and sellprofiles that are similar enough to appear in the same cluster. Asexplained below, the results of the clustering procedure can also beused to make filtering more efficient, and in the service of queryingand browsing tasks.

The k-means clustering method is familiar to those skilled in the art.Briefly put, it finds a grouping of points (target profiles, in thiscase, whose numeric coordinates are given by numeric decomposition oftheir attributes as described above) to minimize the distance betweenpoints in the clusters and the centers of the clusters in which they arelocated. This is done by alternating between assigning each point to thecluster which has the nearest center and then, once the points have beenassigned, computing the (new) center of each cluster by averaging thecoordinates of the points (target profiles) located in this cluster.Other clustering methods can be used, such as “soft or “fizzy” k-meansclustering, in which objects are allowed to belong to more than onecluster. This can be cast as a clustering problem similar to the k-meansproblem, but now the criterion being optimized is a little different:

Σ_(l)Σ_(c) ^(i) _(ic)d(x_(i), {overscore (x)}_(c))

where C ranges over cluster numbers, i ranges over target objects, x_(i)is the numeric vector corresponding to the profile of target objectnumber i, _is the mean of all the numeric vectors corresponding totarget profiles of target objects in cluster number C, termed the“cluster profile” of cluster C, d(*, *) is the metric used to measuredistance between two target profiles, and i_(iC) is a value between 0and 1 that indicates how much target object number i is associated withcluster number C, where i is an indicator matrix with the property thatfor each i, SUM SUB C I SUB iC=1. For k-means clustering, i_(iC) iseither 0 or 1.

Any of these basic types of clustering might be used by the system:

1) Association-based clustering, in which profiles contain onlyassociative attributes, and thus distance is defined entirely byassociations. This kind of clustering generally (a) clusters targetobjects based on the similarity of the users who like them or (b)clusters users based on the similarity of the target objects they like.In this approach, the system does not need any information about targetobjects or users, except for their history of interaction with eachother.

2) Content-based clustering, in which profiles contain onlynon-associative attributes. This kind of clustering (a) clusters targetobjects based on the similarity of their non-associative attributes(such as word frequencies) or (b) clusters users base d on thesimilarity of their non-associative attributes (such as demographics andpsychographics). In this approach, the system does not need to recordany information about users' historical patterns of information access,but it does need information about the intrinsic properties of usersand/or target objects.

3) Uniform hybrid method, in which profiles may contain both associativeand non-associative attributes. This method combines 1 a and 2 a, or 1 band 2 b. The distance d(P_(X), P_(Y)) between two profiles P_(X) andP_(Y) may be computed by the general similarity-measurement methodsdescribed earlier.

4) Sequential hybrid method. First apply the k-means procedure to do 1a, so that articles are labeled by cluster based on which user readthem, then use supervised clustering (maximum likelihood discriminantmethods) using the word frequencies to do the process of method 2 adescribed above. This tries to use knowledge of who read what to do abetter job of clustering based on word frequencies. One could similarlycombine the methods 1 b and 2 b described above.

Hierarchical clustering of target objects is often useful. Hierarchicalclustering produces a tree which divides the target objects first intotwo large clusters of roughly similar objects; each of these clusters isin turn divided into two or more smaller clusters, which in turn areeach divided into yet smaller clusters until the collection of targetobjects has been entirely divided into “clusters” consisting of a singleobject each, as diagrammed in FIG. 8 In this diagram, the node d denotesa particular target object d, or equivalently, a single-member clusterconsisting of this target object. Target object d is a member of thecluster (a, b, d), which is a subset of the cluster (a, b, c, d, e, f),which in turn is a subset of all target objects. The tree shown in FIG.8 would be produced from a set of target objects such as those showngeometrically in FIG. 7. In FIG. 7, each letter represents a targetobject, and axes x1 and x2 represent two of the many numeric attributeson which the target objects differ. Such a cluster tree may be createdby hand, using human judgment to form clusters and subclusters ofsimilar objects, or may be created automatically in either of twostandard ways: top-down or bottom-up. In top-down hierarchicalclustering, the set of all target objects in FIG. 7 would be dividedinto the clusters (a, b, c, d, e, f) and (g, h, i, j k). The clusteringalgorithm would then be reapplied to the target objects in each cluster,so that the cluster (g, h, i, j, k) is subpartitioned into the clusters(g, k) and (h, i, j), and so on to arrive at the tree shown in FIG. 8.In bottom-up hierarchical clustering, the set of all target objects inFIG. 7 would be grouped into numerous small clusters, namely (a, b), d,(c, f), e, (g,k), (h, i), and j. These clusters would then themselves begrouped into the larger clusters (a, b, d), (c, e, f), (g, k), and (h,i, j), according to their cluster profiles. These larger clusters wouldthemselves be grouped into (a, b, c, d, e, f) and (g, k, h, i, j), andso on until all target objects had been grouped together, resulting inthe tree of FIG. 8. Note that for bottom-up clustering to work, it mustbe possible to apply the clustering algorithm to a set of existingclusters. This requires a notion of the distance between two clusters.The method disclosed above for measuring the distance between targetobjects can be applied directly, provided that clusters are profiled inthe same way as target objects. It is only necessary to adopt theconvention that a cluster's profile is the average of the targetprofiles of all the target objects in the cluster; that is, to determinethe cluster's value for a given attribute, take the mean value of thatattribute across all the target objects in the cluster. For the meanvalue to be well-defined, all attributes must be numeric, so it isnecessary as usual to replace each textual or associative attribute withits decomposition into numeric attributes (scores), as describedearlier. For example, the target profile of a single Woody Allen filmwould assign “Woody-Allen” a score of 1 in the “name-of-director” field,while giving “Federico-Fellini” and “Terence-Davies” scores of 0. Acluster that consisted of 20 films directed by Allen and directed byFellini would be profiled with scores of 0.8, 0.2, and 0 respectively,because, for example, 0.8 is the average of 20 ones and 5 zeros.

Searching for Target Objects

Given a target object with target profile P, or alternatively given asearch profile P, a hierarchical cluster tree of target objects makes itpossible for the system to search efficiently for target objects withtarget profiles similar to P. It is only necessarily to navigate throughthe tree, automatically, in search of such target profiles. The systemfor customized electronic identification of desirable objects begins byconsidering the largest, top-level clusters, and selects the clusterwhose profile is most similar to target profile P. In the event of anear-tie, multiple clusters may be selected. Next, the system considersall subclusters of the selected clusters, and this time selects thesubcluster or subclusters whose profiles are closest to target profileP. This refinement process is iterated until the clusters selected on agiven step are sufficiently small, and these are the desired clusters oftarget objects with profiles most similar to target profile P. Anyhierarchical cluster tree therefore serves as a decision tree foridentifying target objects. In pseudo-code form, this process is asfollows (and in flow diagram form in FIGS. 13A and 13B):

1. Initialize list of identified target objects to the empty list atstep 13A00

2. Initialize the current tree T to be the hierarchical cluster tree ofall objects at step 13A01 and at step 13A02 scan the current clustertree for target objects similar to P using the process detailed in FIG.13B. At step 13A03, the list of target objects is returned.

3. At step 13B00, the variable I is set to 1 and for each child subtreeTi of the root of tree T, is retrieved.

4. At step 13B02, calculate d(P, p_(i)), the similarity distance betweenP and p_(i),

5. At step 13B03, if d(P, p_(i))<t, a threshold, branch to one of twooptions

6. If tree Ti contains only one target object at step 13B04, add thattarget object to list of identified target objects at step 13B05 andadvance to step 13B07.

7. If tree Ti contains multiple target objects at step 13B04, scan theith child subtree for target objects similar to P by invoking the stepsof the process of FIG. 13B recursively and then recurse to step 3 (step13A01 in FIG. 13A) with T bound for the duration of the recursion totree Ti, in order to search in tree Ti for target objects with profilessimilar to P.

In step 5 of this pseudo-code, smaller thresholds are typically used atlower levels of the tree, for example by making the threshold an affinefunction or other function of the cluster variance or cluster diameterof the cluster p_(i). If the cluster tree is distributed across aplurality of servers, as described in the section of this descriptiontitled “Network Context of the Browsing System”, this process may beexecuted in distributed fashion as follows; steps 3-7 are executed bythe server that stores the root node of hierarchical cluster tree T, andthe recursion in step 7 to a subcluster tree T_(i) involves thetransmission of a search request to the server that stores the root nodeof tree T_(i), which server carries out the recursive step upon receiptof this request. Steps 1-2 are carried out by the processor thatinitiates the search, and the server that executes step 6 must send amessage identifying the target object to this initiating processor,which adds it to the list.

Assuming that low-level clusters have been already been formed throughclustering, there are alternative search methods for identifying thelow-level cluster whose profile is most similar to a given targetprofile P. A standard back-propagation neural net is one such method: itshould be trained to take the attributes of a target object as input,and produce as output a unique pattern that can be used to identify theappropriate low-level cluster. For maximum accuracy, low-level clustersthat are similar to each other (close together in the cluster tree)should be given similar identifying patterns. Another approach is astandard decision tree that considers the attributes of target profile Pone at a time until it can identify the appropriate cluster. If profilesare large, this may be more rapid than considering all attributes. Ahybrid approach to searching uses distance measurements as describedabove to navigate through the top few levels of the hierarchical clustertree, until it reaches an cluster of intermediate size whose profile issimilar to target profile P, and then continues by using a decision treespecialized to search for low-level subclusters of that intermediatecluster.

One use of these searching techniques is to search for target objectsthat match a search profile from a user's search profile set. This formof searching is used repeatedly in the news clipping service, activenavigation, and Virtual Community Service applications, described below.Another use is to add a new target object quickly to the cluster tree.An existing cluster that is similar to the new target object can belocated rapidly, and the new target object can be added to this cluster.If the object is beyond a certain threshold distance from the clustercenter, then it is advisable to start a new cluster. Several variants ofthis incremental clustering scheme can be used, and can be built usingvariants of subroutines available in advanced statistical packages. Notethat various methods can be used to locate t he new target objects thatmust-be added to the cluster tree, depending on the architecture used.In one method, a “webcrawler” program running on a central computerperiodically scans all servers in search of new target objects,calculates the target profiles of these objects, and adds them to thehierarchical cluster tree by the above method. In another, whenever anew target object is added to any of the servers, a software “agent” atthat server calculates the target profile and adds it to thehierarchical cluster tree by the above method.

Rapid Profiling

In some domains, complete profiles of target objects are not always easyto construct automatically. When target objects are multi-media gamese.g., an attribute such as genre (a single textual term such as“action”, 'suspense/thriller”, “word games”, etc.) may be a matter ofjudgment and opinion. More significantly, if each title has anassociated attribute that records the positive or negative relevancefeedback to that title from various human users (consumers), then allthe association scores of any newly introduced titles are initiallyzero, so that it is initially unclear what other titles are similar tothe new title with respect to the users who like them. Indeed, if thisassociative attribute is highly weighted, the initial lack of relevancefeedback information may be difficult to remedy, due to a vicious circlein which users of moderate-to-high interest are needed to providerelevance feedback but relevance feedback is needed to identify users ofmoderate-to-high interest.

Fortunately, however, it is often possible in principle to determinecertain attributes of a new target object by extraordinary methods,including but not limited to methods that consult a human. For example,the system can in principle determine the genre of a title by consultingone or more randomly chosen individuals from a set of known humanexperts, while to determine the numeric association score between a newtitle and a particular user, it can in principle show the title to thethat user and obtain relevance feedback. Since such requestsinconvenience people, however, it is important not to determine alldifficult attributes this way, but only the ones that are most importantin classifying the article. “Rapid profiling” is a method for selectingthose numeric attributes that are most important to determine. (Recallthat all attributes can be decomposed into numeric attributes, such asassociation scores or term scores.) First, a set of existing targetobjects that already have complete or largely complete profiles areclustered using a k-means algorithm. Next, each of the resultingclusters is assigned a unique identifying number, and each clusteredtarget object is labeled with the identifying number of its cluster.Standard methods then allow construction of a single decision tree thatcan determine any target object's cluster number, with substantialaccuracy, by considering the attributes of the target object, one at atime. Only attributes that can if necessary be determined for any newtarget object are used in the construction of this decision tree. Toprofile a new target object, the decision tree is traversed downwardfrom its root as far as is desired. The root of the decision treeconsiders some attribute of the target object. If the value of thisattribute is not yet known, it is determined by a method appropriate tothat attribute; for example, if the attribute is the association scoreof the target object with user #4589, then relevance feedback (to beused as the value of this attribute) is solicited from user #4589,perhaps by the ruse of adding the possibly uninteresting target objectto a set of objects that the system recommends to the user's attention,in order to find out what the user thinks of it. Once the root attributeis determined, the rapid profiling method descends the decision tree byone level, choosing one of the decision subtrees of the root inaccordance with the determined value of the root attribute. The root ofthis chosen subtree considers another attribute of the target object,whose value is likewise determined by an appropriate method. The processc an be repeated to determine as many attributes as desired, by whatevermethods are available, although it is ordinarily stopped after a smallnumber of attributes, to avoid the burden of determining too manyattributes.

It should be noted that the rapid profiling method can be used toidentify important attributes in any sort of profile, and not justprofiles of target objects. In particular, recall that the disclosedmethod for determining topical interest through similarity requiresusers as well as target objects to have profiles. New users, like newtarget objects, may be profiled or partially profiled through the rapidprofiling process. For example, when user profiles include anassociative attribute that records the user's relevance feedback on alltarget objects in the system, the rapid profiling procedure can rapidlyform a rough characterization of a new users interests by soliciting theuser's feedback on a small number of significant target objects, andperhaps also by determining a small n umber of other key attributes ofthe new user, by on-line queries, telephone surveys, or other means.Once the new user has been partially profiled in this way, the methodsdisclosed above predict that the new user's interests resemble the knowninterests of other users with similar profiles. In a variation; eachuser's user profile is subdivided into a set of long-term attributes,such as demographic characteristics, and a set of short-term attributesthat help to identify the user's temporary desires and emotional state,such as the user's textual or multiple-choice answers to questions whoseanswers reflect the user's mood. A subset of the user's long-termattributes are determined when the user first registers with the system,through the use of a rapid profiling tree of long-term attributes. Inaddition, each time the user logs on to the system, a subset of theuser's short-term attributes are additionally determined, through theuse of a separate rapid profiling tree that asks about short-termattributes.

Market Research

A technique similar to rapid profiling is of interest in market research(or voter research). Suppose that the target objects are consumers. Aparticular attribute in each target profile indicates whether theconsumer described by that target profile h as purchased product X. Adecision tree can be built that attempts to determine what value aconsumer has for this attribute, by consideration of the otherattributes in the consumer's profile. This decision tree may betraversed to determine whether additional users are likely to purchaseproduct X. More generally, the top few levels of the decision treeprovide information, valuable to advertisers who are planningmass-market or direct-mail campaigns, about the most significantcharacteristics of consumers of product X.

Similar information can alternatively be extracted from a collection ofconsumer profiles without recourse to a decision tree, by consideringattributes one at a time, and identifying those attributes on whichproduct X's consumers differ significantly from its non-consumers. Thesetechniques serve to characterize consumers of a particular product; theycan be equally well applied to voter research or other survey research,where the objective is to characterize those individuals from a givenset of surveyed individuals who favor a particular candidate, hold aparticular opinion, belong to a particular demographic group, or havesome other set of distinguishing attributes. Researchers may-wish topurchase batches of analyzed or unanalyzed user profiles from whichpersonal identifying information has been removed. As with anystatistical database, statistical conclusions can be drawn, andrelationships between attributes can be elucidated using knowledgediscovery techniques which are well known in the art.

SUPPORTING ARCHITECTURE

The following section describes the preferred computer and networkarchitecture for implementing the methods described in this patent.

Electronic Media System Architecture

FIG. 1 illustrates in block diagram form the overall architecture of anelectronic media system, known in the art, in which the system forcustomized electronic identification of desirable objects of the presentinvention can be used to provide user customized access to targetobjects that are available via the electronic media system. Inparticular, the electronic media system comprises a data communicationfacility that interconnects a plurality of users with a number ofinformation servers. The users are typically individuals, whose personalcomputers (terminals) T₁-T_(n) are connected via a data communicationslink, such as a modem and a telephone connection established inwell-known fashion, to a telecommunication network N. User informationaccess software is resident on the user's personal computer and servesto communicate over the data communications link and thetelecommunication network N with one of the plurality of network vendorsV₁-V_(k) (America Online, Prodigy, CompuServe, other private companiesor even universities) who provide data interconnection service withselected ones of the information servers I₁-I_(m). The user can, by useof the user information access software, interact with the informationservers I₁-I_(m) to request and obtain access to data that resides onmass storage systems −SS_(m) that are part of the information serverapparatus. New data is input to this system y users via their personalcomputers T₁-T_(n) and by commercial information services by populatingtheir mass storage systems SS₁ −SS_(m) With commercial data. Each userterminal T₁-T_(n) and the information servers I₁-I_(m) have phonenumbers or IP addresses on the network N which enable a datacommunication link to be established between a particular user terminalT₁-T_(n) and the selected information server I₁-I_(m). A user'selectronic mail address also uniquely identifies the user and theuser'network vendor V₁-V_(k) in an industry-standard format such as:username@aol.com or username@netcom.com. The network vendors V1-V_(k)provide access passwords for their subscribers. (selected users),through which the users can access the information servers I₁-I_(m). Thesubscribers pay the network vendors V1-V_(k) for the access services ona fee schedule that typically includes a monthly subscription fee andusage based charges.

A difficulty with this system is that there are numerous informationservers I₁-I_(m) located around the world, each of which provides accessto a set of information of differing format, content and topics and viaa cataloging system that is typically unique to the particularinformation server I₁-I_(m). The information is comprised of individual“files,” which can contain audio data, video data, graphics data, textdata, structured database data and combinations thereof. In theterminology of this patent, each target object is associated with aunique file: for target objects that are informational in nature and canbe digitally represented, the file directly stores the informationalcontent of the target object, while for target objects that are notstored electronically, such as purchasable goods, the file contains anidentifying, description of the target object. Target objects storedelectronically as text files can include commercially provided newsarticles, published documents, letters, user-generated documents,descriptions of physical objects, or combinations of these classes ofdata. The organization of the files containing the information and thenative format of the data contained in files of the same conceptual typemay vary by information server I₁-I_(m).

Thus, a user can have difficulty in locating files that contain thedesired information, because the information may be contained in fileswhose information server cataloging may not enable the user to locatethem. Furthermore, there is no standard catalog that defines thepresence and services provided by all information servers I₁-I_(m). Auser therefore does not have simple access to information but mustexpend a significant amount of time and energy to excerpt a segment ofthe information that may be relevant to the user from the plethora ofinformation that is generated and populated on this system. Even if theuser commits the necessary resources to this task, existing informationretrieval processes lack the accuracy and efficiency to ensure that theuser obtains the desired information. It is obvious that within theconstructs of this electronic media system, the three modules of thesystem for customized electronic identification of desirable objects canbe implemented in a distributed manner, even with various modules beingimplemented on and/or by different vendors within the electronic mediasystem. For example, the information servers I₁-I_(m) can include thetarget profile generation module while the network vendors V₁-V_(k) mayimplement the user profile generation module, the target profileinterest summary generation module, and/or the profile processingmodule. A module can itself be implemented in a distributed manner, withnumerous nodes being present in the network N, each node serving apopulation of users in a particular geographic area. The totality ofthese nodes comprises the functionality of the particular module.Various other partitions of the modules and their functions are possibleand the examples provided herein represent illustrative examples and arenot intended to limit the scope of the claimed invention. For thepurposes of pseudonymous creation and update of users' target profileinterest summaries (as described below), the vendors V₁-V_(k) may beaugmented with some number of proxy servers, which provide a mechanismfor ongoing pseudonymous access and profile building through the methoddescribed herein. At least one trusted validation server must be inplace to administer the creation of pseudonyms in the system.

An important characteristic of this system for customized electronicidentification of desirable objects is its responsiveness, since theintended use of the system is in an interactive mode. The system utilitygrows with the number of the users and this increases the number ofpossible consumer/product relationships between users and targetobjects. A system that serves a large group of users must maintaininteractive performance and the disclosed method for profiling andclustering target objects and users can in turn be used for optimizingthe distribution of data among the members of a virtual community andthrough a data communications network, based on users' target profileinterest summaries.

Network Elements and System Characteristics

The various processors interconnected by the data communication networkN as shown in FIG. 1 can be divided into two classes and grouped asillustrated in FIG. 2: clients and servers. The clients C1-Cn areindividual user's computer systems which are connected to servers S1-S5at various times via data, communications links. Each of the clients Ciis typically associated with-a single server Sj, but these associationscan change over time. The clients C1-Cn both interface with users andproduce and retrieve files to and from servers. The clients C1-Cn arenot necessarily continuously on-line, since they typically serve asingle user and can be movable systems, such as laptop computers, whichcan be connected to the data communications network N at any of a numberof locations. Clients could also be a variety of other computers, suchas computers and kiosks providing access to customized information aswell as targeted advertising to many users, where the users identifythemselves with passwords or with smart cards. A server Si is a computersystem that is presumed to be continuously on-line and functions to bothcollect files from various sources on the data communication network Nfor access by local clients C1-Cn and collect files from local clientsC1-Cn for access by remote clients. The server Si is equipped withpersistent storage, such as a magnetic disk data storage medium, and areinterconnected with other servers via data communications links. Thedata communications links can be of arbitrary topology and architecture,and are described herein for the purpose of simplicity as point-to-pointlinks or, more precisely, as virtual point-to-point links. The serversS1-S5 comprise the network vendors V1-Vk as well as the informationservers I₁-I_(m) of FIG. 1 and the functions performed by these twoclasses of modules can be merged to a greater or lesser extent in asingle server Si or distributed over a number of servers in the datacommunication network N. Prior to proceeding with the description of thepreferred embodiment of the invention, a number of terms are defined.FIG. 3 illustrates in block diagram form a representation of anarbitrarily selected network topology for a plurality of servers A-D,each of which is interconnected to at least one other server andtypically also to a plurality of clients p-s. Servers A-D areinterconnected by a collection of point to point data communicationslinks, and server A is connected to client r; server B is connected toclients p-q, while server D is connected to client s. Servers transmitencrypted or unencrypted messages amongst themselves: a messagetypically contains the textual and/or graphic information stored in aparticular file, and also contains data which describe the type andorigin of this file, the name of the server that is supposed to receivethe message, and the purpose for which the file contents are beingtransmitted. Some messages are not associated with any file, but aresent by one server to other servers for control reasons, for example torequest transmission of a file or to announce the availability of a newfile. Messages can be forwarded by a server to another server, as in thecase where server A transmits a message to server D via a relay node ofeither server C or servers B, C. It is generally preferable to havemultiple paths through the network, with each path being characterizedby its performance capability and cost to enable the network N tooptimize traffic routing.

Proxy Servers and Pseudonymous Transactions

While the method of using target profile interest summaries presentsmany advantages t o both target object providers and users, there areimportant privacy issues for both users and providers that must beresolved if the system is to be used: freely and without inhibition byusers without fear of invasion of privacy. It is likely that user sdesire that some, if not all, of the user-specific information in theiruser profiles and target profile interest summaries remain confidential,to be disclosed only under certain circumstances related to certaintypes of transactions and according to their personal wishes fordiffering levels of confidentiality regarding their purchases andexpressed interests.

However, complete privacy and inaccessibility of user transactions andprofile summary information would hinder implementation of the systemfor customized electronic identification of desirable objects and woulddeprive the user of many of the ad vantages derived through the system'suse of user-specific information. In many cases, complete and totalprivacy is not desired by all parties to a transaction. For example, abuyer may desire to be targeted for certain mailings that describeproducts that are related to his or her interests, and a seller maydesire to target users who are predicted to be interested in the goodsand services that the seller provides. Indeed, the usefulness of thetechnology described herein is contingent upon the ability of the systemto collect and compare data about many users and many target objects. Acompromise between total user anonymity and total public disclosure ofthe user's search profiles or target profile interest summary is apseudonym. A pseudonym is an artifact that allows a service provider tocommunicate with users and build and accumulate records of theirpreferences over time, while at the same time remaining ignorant of theusers' true identities, so that users can keep their purchases orpreferences private. A second and equally important requirement of apseudonym system is that it provide for digital credentials, which areused to guarantee that the user represented by a particular pseudonymhas certain properties. These credentials may be granted on the basis ofresult of activities and transactions conducted by means of the systemfor customized electronic identification of desirable objects, or on thebasis of other activities and transactions conducted on the network N ofthe present system, on the basis of users' activities outside of networkN. For example, a service provider may require proof that the purchaserhas sufficient funds on deposit at his/her bank, which might possiblynot be on a network, before agreeing to transact business with thatuser. The user, therefore, must provide the service provider with proofof funds (a credential) from the bank, while still not disclosing theuser's true identity to the service provider.

Our method solves the above problems by combining the pseudonym grantingand credential transfer methods taught by D. Chaum and J. H. Evertse, inthe paper titled “A secure and privacy-protecting protocol fortransmitting personal information between organizations,” with theimplementation of a set of one or more proxy servers distributedthroughout the network N. Each proxy server, for example S2 in FIG. 2,is a server which communicates with clients and other servers Sin thenetwork either directly or through anonymizing mix paths as detailed inthe paper by D.Chaum titled “Untraceable Electronic Mail, ReturnAddresses, and Digital Pseudonyms,” published in Communications of theACM, Volume 24, Number 2, February 1981. Any server in the network N maybe configured to act as a proxy server in addition to its otherfunctions. Each proxy server provides service to a set of users, whichset is termed the “user base” of that proxy server. A given proxy serverprovides three sorts of service to each user U in its user base, asfollows:

1. The first function of the proxy server is to bidirectionally transfercommunications between user U and other entities such as informationservers (possibly including the proxy server itself) and/or other users.Specifically, letting S denote the server that is directly associatedwith user U's client processor, the proxy server communicates withserver S (and thence with user U), either through anonymizing mix pathsthat obscure the identity of server S and user U, in which case theproxy server knows user U only through a secure pseudonym, or elsethrough a conventional virtual point-to-point connection, in which casethe proxy server knows user. U by user Us address at server S, whichaddress may be regarded as a non-secure pseudonym for user U.

2. A second function of the proxy server is to record user-specificinformation associated with user U. This user-specific informationincludes a user profile and target profile interest summary for user U,as well as a list of access control instructions specified by user U, asdescribed below, and a set of one-time return addresses provided by userU that can be used to send messages to user U without knowing user U'strue identity. All of this user-specific information is stored in adatabase that is keyed by user Us pseudonym (whether secure ornon-secure) on the proxy server.

3. A third function of the proxy server is to act as a selectiveforwarding agent for unsolicited communications that are addressed touser U: the proxy server forwards some such communications to user U andrejects others, in accordance with the access control instructionsspecified by user U.

Our combined method allows a given user to use either a single pseudonymin all transactions where he or she wishes to remain pseudonymous, orelse different pseudonyms for different types of transactions. In thelatter case, each service provider might transact with the user under adifferent pseudonym for the user. More generally, a coalition of serviceproviders, all of whom match users with the same genre of targetobjects, might agree to transact with the user using a common pseudonym,so that the target profile interest summary associated with thatpseudonym would be complete with respect to said genre of targetobjects. When a user employs several pseudonyms in order to transactwith different coalitions of service providers, the user may freelychoose a proxy server to service each pseudonym; these proxy servers maybe the same or different. From the service provider's perspective, oursystem provides security, in that it can guarantee that users of aservice are legitimately entitled to the services used and that no useris using multiple pseudonyms to communicate with the same provider. Thisuniqueness of pseudonyms is important for the purposes of thisapplication, since the transaction information gathered for a givenindividual must represent a complete and consistent picture of a singleuser's activities with respect to a given service provider or coalitionof service providers; otherwise, a user's target profile interestsummary and user profile would not be able to represent the user'sinterests to other parties as completely and accurately as possible.

The service provider must have a means of protection from users whoviolate previously agreed upon terms of service. For example, if a userthat uses a given pseudonym engages in activities that violate the termsof service, then the service provider should be able to take actionagainst the user, such as denying the user service and blacklisting theuser from transactions with other parties that the user might be temptedto defraud. This type of situation might occur when a user employs aservice provider for illegal activities or defaults in payments to theservice provider. The method of the paper titled “Security withoutidentification: Transaction systems to make Big-Brother obsolete”,published in the Communications of the ACM, 28(10), October 1985;pp.1030-1044, incorporated herein, provides for a mechanism to enforceprotection against this type of behavior through the use of resolutioncredentials, which are credentials that are periodically provided toindividuals contingent upon their behaving consistent with the agreedupon terms of service between the user and information provider andnetwork vendor entities (such as regular payment for services rendered,civil conduct, etc.). For the user's safety, if the issuer of aresolution credential refuses to grant this resolution credential to theuser, then the refusal may be appealed to an adjudicating third party.The integrity of the user profiles and target profile interest summariesstored on proxy servers is important: if a seller relies on suchuser-specific information to deliver promotional offers or othermaterial to a particular class of users, but not to other users, thenthe user-specific information must be accurate and untampered with inany way. The user may likewise wish to ensure that other parties nottamper with the user's user profile and target profile interest summary,since such modification could degrade the system's ability to match theuser with the most appropriate target objects. This is done by providingfor the user to apply digital signatures to the control messages sent bythe user to the proxy server. Each pseudonym is paired with a publiccryptographic key and a private cryptographic key, where the private keyis known only to the user who holds that pseudonym; when the user sendsa control message to a proxy server under a given pseudonym, the proxyserver uses the pseudonym's public key to verify that the message hasbeen digitally signed by someone who knows the pseudonym's private key.This prevents other parties from masquerading as the user.

Our approach, as disclosed in this application, provides an improvementover the prior art in-privacy-protected pseudonymy for networksubscribers such as taught in U.S. Pat. No. 5,245,656, which providesfor a name translator station to act as an intermediary between aservice provider and the user. However, while U.S. Pat. No. 5,245,656provides that the information transmitted between the end user U and theservice provider be doubly encrypted, the fact that a relationship exists between user U and the service provider is known to the nametranslator, and this fact could be used to compromise user U, forexample if the service provider specializes in the provision of contentthat is not deemed acceptable by user U's peers. The method of U.S. Pat.No. 5,245,656 also omits a method for the convenient updating ofpseudonymous user profile information, such as is provided in thisapplication, and does not provide for assurance of unique andcredentialed registration of pseudonyms from a credentialing agent as isalso provided in this application, and does not provide a means ofaccess control to the user based on profile information and conditionalaccess as will be subsequently described. The method described by Loebet al also does not describe any provision for credentials, such asmight be used for authenticating a, user's right to access particulartarget objects, such as target objects that are intended to be availableonly upon payment of a subscription fee, or target objects that areintended to be unavailable to younger users.

Proxy Server Description

In order that a user may ensure that some or all of the information inthe user's user profile and target profile interest summary remaindissociated from the user's true identity, the user employs as anintermediary any one of a number of proxy servers available on the datacommunication network N of FIG. 2 (for example, server S2). The proxyservers function to disguise the true identity of the user from otherparties on the data communication network N. The proxy server representsa given user to either single network vendors and information servers orcoalitions thereof. A proxy server, e.g. S2, is a server computer withCPU, main memory, secondary disk storage and network communicationfunction and with a database function which retrieves the target profileinterest summary and access control instructions associated with aparticular pseudonym P, which represents a particular user U, andperforms bi-directional routing of commands, target objects and billinginformation between the user at a given client (e.g. C3) and othernetwork entities such as network vendors V1-Vk and information serversI1-Im. Each proxy server maintains an encrypted target profile interestsummary associated with each allocated pseudonym in its pseudonymdatabase D. The actual user-specific information and the associatedpseudonyms need not be stored locally on the proxy server, but mayalternatively be stored in a distributed fashion and be remotelyaddressable from the proxy server via point-to-point connections.

The proxy server supports two types of bi-directional connections:point-to-point connections and pseudonymous connections through mixpaths, as taught by P.Chaum in the paper titled “Untraceable ElectronicMail, Return Addresses, and Digital Pseudonyms”, Communications of theACM, Volume 24, Number 2, February 1981. The normal connections betweenthe proxy server and information servers, for example a is connectionbetween proxy server S2 and information server S4 in FIG. 2, areaccomplished through the point-to-point connection protocols provided bynetwork N as described in the “Electronic Media System Architecture”section of this application. The normal type of point-to-pointconnections may be used between S2-S4, for example, since thedissociation of the user and the pseudonyma need only occur between theclient C3 and the proxy server S2, where the pseudonym used by the useris available. Knowing that an information provider such as S4communicates with a given pseudonym P on proxy server S2 does notcompromise the true identity of user U. The bidirectional connectionbetween the user and the proxy server S2 can also be a normalpoint-to-point connection, but it may instead be made anonymous andsecure, if the user desires, though the consistent use of an anonymizingmix protocol as taught by D.Chaum in the paper titled “UntraceableElectronic Mail, Return Addresses, and Digital Pseudonyms”,Communications of the ACM, Volume 24, Number 2, February 1981. This mixprocedure provides untraceable secure anonymous mail between to partieswith blind return addresses through a set of forwarding and returnmounting servers termed “mixes” The mix routing protocol, as taught inthe Chaum paper, is used with the proxy server S2 to provide a registryof persistent secure pseudonyms that can be employed by users other thanuser U, by information providers I1-Im, by vendors V1-Vk and by otherproxy servers to communicate with the users in the proxy server's userbase on a continuing basis. The security provided by this mix pathprotocol is distributed and resistant to traffic analysis attacks andother known forms of analysis which may be used by malicious parties totry and ascertain the true identity of a pseudonym bearer. Breaking theprotocol requires a large number of parties to maliciously collude or becryptographically compromised. In addition an extension to the method istaught where the user can include a return path definition in themessage so the information server S4 can return the requestedinformation to the user's client processor C3 We utilize this feature ina novel fashion to provide for access and reachability control underuser and proxy server control.

Validation and Allocation of a Unique Pseudonym

Chaum's pseudonym and credential issuance system, as described in apublication by D. Chaum and J. H. Evertse, titled “A secure andprivacy-protecting protocol for transmitting personal informationbetween organizations,” has several desirable properties for use as acomponent in our system. The system allows for individuals to usedifferent pseudonyms with different organizations (such as banks andcoalitions of service providers). The organizations which are presentedwith a pseudonym have no more information about the individual than thepseudonym itself and a record of previous transactions carried out underthat pseudonym Additionally, credentials, which represent facts about apseudonym that an organization is willing to certify, can be granted toa particular pseudonym, and transferred to other pseudonyms that thesame user employs. For, example, the user can use different pseudonymswith different organizations (or disjoint sets of organizations), yetstill present credentials that were granted by one organization, underone pseudonym, in order to transact with another organization underanother pseudonym, without revealing that the two pseudonyms correspondto the same user. Credentials may be granted to provide assurancesregarding the pseudonym bearer's age, financial status, legal status,and the like. For example, credentials signifying “legal adult” may beissued to a pseudonym based on information known about the correspondinguser by the given is suing organization. Then, when the credential istransferred to another pseudonym that represents the user to anotherdisjoint organization, presentation of this credential on the otherpseudonym can be taken as proof of legal adulthood, which might satisfya condition of terms of service. Credential-issuing organizations mayalso certify particular facts about a users demographic profile ortarget profile interest summary, for example by granting a credentialthat asserts “the bearer of this pseudonym is either well-read or ismiddle-aged and works for a large company”; by presenting thiscredential to another entity, the user can prove eligibility for (say) adiscount without revealing the user's personal data to that entity.

Additionally, the method taught by Chaum provides for assurances that noindividual may correspond with a given organization or coalition oforganizations using more than one pseudonym; that credentials may not befeasibly forged by the user; and t hat credentials may not betransferred from one user's pseudonym to a different user's pseudonym.Finally, the method provides for expiration of credentials and for theissuance of “black marks” against Individuals who do not act accordingto the terms of service that they are extended. This is done through theresolution credential mechanism as described in Chaum's work, in whichresolutions are issued periodically by organizations to pseudonyms thatare in good standing. If a user is not issued this resolution credentialby a particular organization or coalition of organization, then thisuser cannot have it available to be transferred to other pseudonymswhich he uses with other organizations. Therefore, the user cannotconvince these other organizations that he has acted accordance withterms of service in other dealings. If this is the case, then theorganization can use this lack of resolution credential to infer thatthe user is not in good standing in his other dealings. In one approachorganizations (or other users) may issue a list of quality relatedcredentials based upon the experience of transaction (or interaction)with the user which may act similarly to a letter of recommendation asin a resume. If such a credential is issued from multiple organizations,their values become averaged. In an alternative variation organizationsmay be issued credentials from users such as customers which may be usedto indicate to other future users quality of service which can beexpected by subsequent users on the basis of various criteria.

In our implementation, a pseudonym is a data record consisting of twofields. The first field specifies the address of the proxy server atwhich the pseudonym is registered. The second field contains a uniquestring of bits (e.g., a random binary number) that is associated with aparticular user; credentials take the form of public-key digitalsignatures computed on this number, and the number itself is issued by apseudonym administering server Z, as depicted in FIG. 2, and detailed In a generic form in the paper by D. Chaum and J. H. Evertse, titled “Asecure and privacy-protecting-protocol for transmitting personalinformation between organizations.”. It is possible to send informationto the user holding a given pseudonym, by enveloping the information ina control message that specifies the pseudonym and is addressed to theproxy server that is named in the first field of the pseudonym; theproxy server may forward the information to the user upon receipt of thecontrol message.

While the user may use a single pseudonym for all transactions, in themore general case a user has a set of several pseudonyms, each of whichrepresents the user in his or her interactions with a single provider orcoalition of service providers. Each pseudonymin the pseudonym set isdesignated for transactions with a different coalition of relatedservice providers and the pseudonyms used with one provider or coalitionof providers cannot be linked to the pseudonyms used with other disjointcoalitions of providers. All of the user's transactions with a givencoalition can be linked by virtue of the fact that they are conductedunder the same pseudonym, and therefore can be combined to define aunified picture, in the form of a user profile and a target profileinterest summary, of the user's interests vis-à-vis the service orservices provided by said coalition. There are other circumstances forwhich the use of a pseudonym may be useful and the present descriptionis in no way intended to limit the scope of the claimed invention forexample, the previously described rapid profiling tree could be used topseudonymously acquire information about the user which is considered bythe user to be sensitive such as that information which is of interestto such entities as insurance companies, medical specialists, familycounselors or dating services.

Detailed Protocol

In our system, the organizations that the user U interacts with are theservers S1-Sn on the network N. However, rather than directlycorresponding with each server, the user employs a proxy server, e.g.S2, as an intermediary between the local server of the user s own clientand the information provider or network vendor. Mix paths as describedby D.Chaum in the paper titled “Untraceable Electronic Mail, ReturnAddresses, and Digital Pseudonyms”, Communications of the ACM, Volume24, Number 2, February 1981 allow for untraceability and securitybetween the client, such as C3, and the proxy server, e.g. S2. LetS(M,K) represent the digital signing of message M by modularexponentiation with key K as detailed in a paper by Rivest, R. L.,Shamir, A., and Adleman, L. Titled “A method for obtaining digitalsignatures and public-key cryptosystems”, published in the Comm. ACM 21,2 Feburary 120-126. Once a user applies to server. Z for a pseudonym Pand is granted a signed pseudonym signed with the private key SK_(Z) ofserver Z, the following protocol takes place to establish an entry forthe user U in the proxy server S2's database D. 1. The user now sendsproxy server S2 the pseudonym, which has been signed by Z to indicatethe authenticity and uniqueness of the pseudonym. The user alsogenerates a PK_(P), SK_(P) key pair for use with the granted pseudonym,where is the private key associated with the pseudonym and PK_(P) is thepublic key associated with the pseudonym. The user forms a request toestablish pseudonym P on proxy server S2, by sending the signedpseudonym S(P, SK_(Z)) to the proxy server S2 along with a request tocreate a new database entry, indexed by P, and the public key PK_(P). Itenvelopes the message and transmits it to a proxy server S2 through ananonymizing mix path, along with an anonymous return envelope header. 2.The proxy server S2 receives the database creation entry request andassociated certified pseudonym message. The proxy server S2 checks toensure that the requested pseudonym P is signed by server Z and if sogrants the request and creates a database entry for the pseudonym, aswell as storing the user's public key PK_(P) to ensure that only theuser U can make requests in the future using pseudonym P. 3. Thestructure of the user's database entry consists of a user profile asdetailed herein, a target profile interest summary as detailed herein,and a Boolean combination of access control criteria as detailed below,along with the associated public key for the pseudonym P. 4. At any timeafter database entry for Pseudonym P is established, the user U mayprovide proxy server S2 with credentials on that pseudonym, provided bythird parties, which credentials make certain assertions about thatpseudonym. The proxy server may verify those credentials and makeappropriate modifications to the user's profile as required by thesecredentials such as recording the user's new demographic status as anadult. It may also store those credentials, so that it can present themto service providers on the user's behalf.

The above steps may be repeated, with either the same or a differentproxy server, each time user U requires a new pseudonym for use with anew and disjoint coalition of providers. In practice there is anextremely small probability that a given pseudonym may have already beenallocated by due to the random nature of the pseudonym generationprocess carried out by Z. If this highly unlikely event occurs, then theproxy server S2 may reply to the user with a signed message indicatingthat the generated pseudonym has already been allocated, and asking fora new pseudonym to be generated.

Pseudonymous Control of an Information Server

Once a proxy server S2 has authenticated and registered a user'spseudonym, the user may begin to use the services of the proxy serverS2, in interacting with other network entities such as serviceproviders, as exemplified by server S4 in FIG. 2, an information serviceprovider node connected to the network. The user controls the proxyserver S2 by forming digitally encoded requests that the usersubsequently transmits to the proxy server S2 over the network N. Thenature and format of these requests will vary, since the proxy servermay be used for any of the services described in this application, suchas the browsing , querying, and other navigational functions describedbelow.

In a generic scenario, the user wishes to communicate under pseudonym Pwith a particular information provider or user at address A, where P isa pseudonym allocated to the user and A is either a public networkaddress at a server such as S4, or another pseudonym that is registeredon a proxy server such as S4. (In the most common version of thisscenario, address A is the address of an information provider, and theuser is requesting that the in formation provider send target objects ofinterest.) The user must form a request R to proxy server S2, thatrequests proxy server S2 to send a message to address A and to forwardthe response back to the user. The, user may thereby communicate withother parties, either non-pseudonymous parties, in the case whereaddress A is a public network address, or pseudonymous parties, in thecase where address A is a pseudonym held by, for example, a business oranother user who prefers to operate pseudonymously.

In other scenarios, the request R to proxy server S2 formed by the usermay have different content. For example, request R may instruct proxyserver S2 to use the methods described later in this description toretrieve from the most convenient server a particular piece ofinformation that has been multicast to many servers, and to send thisinformation to the user. Conversely, request R may instruct proxy serverS2 to multicast to many servers a file associated with a new targetobject provided by the user, as described below. If the user is asubscriber to the news clipping service described below, request R mayinstruct proxy server S2 to forward to the user all target objects thatthe news clipping service has sent to proxy server S2 for the user'sattention. If the user is employing the active navigation servicedescribed below, request R may instruct proxy server S2 to select aparticular cluster from the hierarchical cluster tree and provide a menuof its subclusters to the user, or to activate a query that temporarilyaffects proxy server S2's record of the user's target profile interestsummary. If the user is a member of a virtual community as describedbelow, request R may instruct proxy server S2 to forward to the user allmessages that have been sent to the virtual community.

Regardless of the content of request R, the user, at client C3,initiates a connection to the user's local server S1, and instructsserver S1 to send the request R along a secure mix path to the proxyserver S2, initiating the following sequence of actions:

1. The user's client processor C3 forms a signed message S(R, SK_(P)),which is paired with the user's pseudonym P and (if the request Rrequires airesponse) a secure one-time set of return envelopes, to forma message M. It protects the message M with an multiply enveloped routefor the outgoing path. The enveloped route s provide for securecommunication between S1 and the proxy server S2. The message M isenveloped in the most deeply nested message and is therefore difficultto recover should the message be intercepted by an eavesdropper.

2. The message M is sent by client C3 to its local server S1, and isthen routed by the data communication network. N from server S1 througha set of mixes as dictated by the outgoing envelope set and arrives atthe selected proxy server S2.

3. The proxy server S2 separates the received message M into the requestmessage R, the pseudonym P, and (if included) the set of envelopes forthe return path. The proxy server S2 uses pseudonym P to index andretrieve the corresponding record in proxy server S2's database, whichrecord is stored in local storage at the proxy server S2 or on otherdistributed storage media accessible to. proxy server S2 via the networkN. This, record contains a public key PK_(P), user-specific information,and credentials associated with pseudonym P. The proxy server S2 usesthe public key PK_(P) to check that the signed version S(R, SK_(P)) ofrequest message R is valid.

4. Provided that the signature on request message R is valid, the proxyserver S2 acts on the request R. For example, in the generic scenariodescribed above, request message R includes an embedded message M1 andan address A to whom message M1 should be sent; in this case, proxyserver S2 sends message M1 to the server named in address A, such asserver S4. The communication is done using signed and optionallyencrypted messages over the normal point to point connections providedby the data communication network N. When necessary in order to act onembedded message M1, server S4 may exchange or be caused to exchangefurther signed and optionally encrypted messages with proxy server S2,still over normal point to point connections, in order to negotiate therelease of user-specific information and credentials from proxy serverS2. In particular, server S4 may require server S2 to supply credentialsproving that the user is entitled to the information requested—forexample, proving that the user is a subscriber in good standing to aparticular information service, that the user is old enough to legallyreceive adult material, and that the user has been offered a particulardiscount (by means of a special discount credential issued to the user'spseudonym).

5. If proxy server S2 has sent a message to a server S4 and server S4has created a response M2 to message M1 to be sent to the user, thenserver S4 transmits the response M2 to the proxy server S2 using normalnetwork point-to-point connections.

6. The proxy server 82, upon receipt of the response M2, creates areturn message Mr comprising the response M2 embedded in the returnenvelope set that was earlier transmitted to proxy server S2 by the userin the original message M. It transmits the return message Mr along thepseudonymous mix path specified by this return envelope set, so that theresponse M2 reaches the user at the user's client processor C3.

7. The response M2 may contain a request for electronic payment to theinformation server S4. The user may then respond by means of a messageM3 transmitted by the same means as described for message M1 above,which message M3 encloses some form of anonymous payment. Alternatively,the proxy server may respond automatically with such a payment, which isdebited from an account maintained by the proxy server for this user.

8. Either the response message M2 from the information server S4 to theuser, or a subsequent message sent by the proxy server S2 to the user,may contain advertising material that is related to the user's requestand/or is targeted to the user. Typically, if the user has justretrieved a target object X, then (a) either proxy server S2 orinformation server S4 determines a weighted set of advertisements thatare “associated with” target object X, (b) a subset of this set ischosen randomly, where the weight of an advertisement is proportional tothe probability that it is included in the subset, and (c) proxy serverS2 selects from this subset just those advertisements that the user ismost likely to be interested in. In the variation where proxy server S2determines the set of advertisements associated with target object X,then this set typically consists of all advertisements that the proxyserver's owner has been paid to disseminate and whose target profilesare within a threshold similarity distance of the target profile oftarget object X. In the variation where proxy server 84 determines theset of advertisements associated with target object X, advertiserstypically purchase the right to include advertisements in this set. Ineither case, the weight of an advertisement is determined by the amountthat an advertiser is willing to pay. Following step (c), proxy serverS2 retrieves the selected advertising material and transmits it to theuser's client processor C3, where it will be displayed to the user,within a specified length of time after it is received, by a trustedprocess running on the user's client processor C3. When proxy server S2transmits an advertisement, it sends a message to the advertiser,indicating that the advertisement has been transmitted to a user with aparticular predicted level of interest. The message may also indicatethe identity of target object X. In return, the advertiser may transmitan electronic payment to proxy server S2; proxy server S2 retains aservice fee for itself, optionally forwards a service fee to informationserver S4, and the balance is forwarded to the user or used to creditthe user's account on the proxy server.

9. If the response M2 contains or identifies a target object, thepassive and/or active relevance feedback that the user provides on thisobject is tabulated by a process on the user's client processor C3. Asummary of such relevance feedback information, digitally signed byclient processor C3 with a proprietary private key SK_(C3), isperiodically transmitted through an a secure mix path to the proxyserver S2, whereupon the search profile generation module 202 residenton server S2 updates the appropriate target profile interest summaryassociated with pseudonym P, provided that the signature on the summarymessage can be authenticated with the corresponding public key PK_(C3)which is available to all tabulating process that are ensured to haveintegrity.

When a consumer enters into a financial relationship with a particularinformation server based on both parties agreeing to terms for therelationship, a particular pseudonym may be extended for the consumerwith respect to the given provider as detailed in the previous section.When entering into such a relationship, the consumer and the serviceprovider agree to certain terms. However, if the user violates the termsof this relationship, the service provider may decline to provideservice to the pseudonym under which it transacts with the user. Inaddition, the service provider has the recourse of refusing to provideresolution credentials to the pseudonym, and may choose to do so untilthe pseudonym bearer returns to good standing.

Pre-Fetching of Target Objects

In some circumstances, a user may request access in sequence to manyfiles, which are stored on one or more information servers. Thisbehavior is common when navigating a hypertext system such as the WorldWide Web, or when using the target object browsing system describedbelow.

In general, the user requests access to a particular target object ormenu of target objects; once the corresponding file has been transmittedto the user's client processor, the user views its contents and makesanother such request, and so on. Each request may take many seconds tosatisfy, due to retrieval and transmission delays. However, to theextent that the sequence of requests is predictable, the system forcustomized electronic identification of desirable objects can respondmore quickly to each request, by retrieving or starting to retrieve theappropriate files even before the user requests them. This earlyretrieval is termed “pre-fetching of files.”

Pre-fetching of locally stored data has been heavily studied in memoryhierarchies, including CPU-caches and secondary storage (disks), forseveral decades. A leader in this area has been A. J. Smith of Berkeley,who identified a variety of schemes and analyzed opportunities usingextensive traces in both databases and CPU caches. His conclusion wasthat general schemes only really paid off where there was somereasonable chance that sequential access was occurring, e.g., in asequential read of data. As the balances between various latencies inthe memory hierarchy shifted during the late 1980's and early 1990's, J.M. Smith and others identified further opportunities for pre-fetching ofboth locally stored data and network data. In particular, deeperanalysis of patterns in work by Blaba showed the possibility of usingexpert systems for deep pattern analysis that could be used forpre-fetching. Work by J. M. Smith proposed the use of reference historytrees to anticipate references in storage hierarchies where there wassome historical data. Recent work by Touch and the Berkeley workaddressed the case of data on the World-Wide Web, where the large sizeof images and the long latencies provide extra incentive to pre-fetch;Touch's technique is to pre-send when large bandwidths permit somespeculation using HTML storage references embedded in WEB pages, and theBerkeley work uses techniques similar toy J. M. Smith's referencehistories specialized to the semantics of HTML data.

Successful pre-fetching depends on the ability of the system to predictthe next action or actions of the user. In the context of the system forcustomized electronic identification of desirable objects, it ispossible to cluster users into groups according to the similarity oftheir user profiles. Any of the well-known pre-fetching methods thatcollect and utilize aggregate statistics on past user behavior, in orderto predict future user behavior, may then be implemented in so as tocollect and utilize a separate set of statistics for each cluster ofusers. In this way, the system generalizes its access pattern statisticsfrom each user to similar users, without generalizing among users whohave substantially different interests. The system may further collectand utilize a similar set of statistics that describes the aggregatebehavior of all users; in cases where the system cannot confidently makea prediction as to what a particular user will do, because the relevantstatistics concerning that user's user cluster are derived from only asmall amount of data, the system may instead make its predictions basedon the aggregate statistics for all users, which are derived from alarger amount of data. For the sake of concreteness, we now describe aparticular instantiation of a pre-fetching system, that both employsthese insights and that makes its pre-fetching decisions throughaccurate measurement of the expected cost and benefit of each potentialpre-fetch.

Pre-fetching exhibits a cost-benefit tradeoff. Let t denote theapproximate number of minutes that pre-fetched files are retained inlocal storage (before they are deleted to make room for otherpre-fetched files). If the system elects to pre-fetch a filecorresponding to a target object X, then the user benefits from a fastresponse at no extra cost, provided that the user explicitly requeststarget object X soon thereafter. However, if the user does not requesttarget object X within t minutes of the pre-fetch, then the pre-fetchwas worthless, and its cost is an added cost that must be borne(directly or indirectly) by the user. The first scenario thereforeprovides benefit at no cost, while the second scenario incurs a cost atno benefit. The system tries to favor the first scenario by pre-fetchingonly those files that the user will access' anyway. Depending on theuser's wishes, the system may pre-fetch either conservatively, where itcontrols costs by pre-fetching only files that the user is extremelylikely to request explicitly (and that are relatively cheap toretrieve), or more aggressively, where it also pre-fetches files thatthe user is only moderately likely to request explicitly, therebyincreasing both the total cost and (to a lesser degree) the totalbenefit to the user.

In the system described herein, pre-fetching for a user U isaccomplished by the user's proxy server S. Whenever proxy server Sretrieves a user-requested file F from an information server, it usesthe identity of this file F and the characteristics of the user, asdescribed below, to identify a group of other files G1 . . . Gk that theuser is likely to access soon. The user's request for file F is said to“trigger” files G1 . . . Gk. Proxy server S pre-fetches each of thesetriggered files Gi as follows:

1. Unless file Gi is already stored locally (e.g., due to previouspre-fetch), proxy server S retrieves file Gi from an appropriateinformation server and stores it locally.

2. Proxy server S timestamps' its local copy of file Gi as having justbeen pre-fetched, so that file Gi will be retained in local storage fora minimum of approximately t minutes before being deleted.

Whenever user U (or, in principle, any other user registered with proxyserver S) requests proxy server S to retrieve a file that has beenpre-fetched and not yet deleted, proxy server S can then retrieve thefile from local; storage rather than from another server. In a variationon steps 1-2 above, proxy server S pre-fetches a file Gi somewhatdifferently, so that pre-fetched files are stored on the user's clientprocessor q rather than on server S:

1. If proxy server S has not pre-fetched file Gi in the past t minutes,it retrieves file Gi and transmits it to user U's client processor q.

2. Upon receipt of the message sent in step 1, client q stores a localcopy of file Gi if one is not currently stored.

3. Proxy server S notifies client q that client q should timestamp itslocal copy of file Gi; this notification may be combined with themessage transmitted in step 1, if any.

4. Upon receipt of the message sent in step 3, client q timestamps itslocal copy of file Gi as having just been pre-fetched, so that file Giwill be retained in local storage for a minimum of approximately tminutes before being deleted. During the period that client q retainsfile Gi in local storage, client q can respond to any request for fileGi (by user U or, in principle, any other user of client q) immediatelyand without the assistance of proxy server S.

The difficult task-is for proxy server S, each time it retrieves a fileF in response to a request, to identify the files G1 . . . Gk thatshould be triggered by the request for file F and pre-fetchedimmediately. Proxy server S employs a cost-benefit analysis, performingeach pre-fetch whose benefit exceeds a user-determined multiple of itscost; the user may set the multiplier low for aggressive prefetching orhigh for conservative prefetching. These pre-fetches may be performed inparallel. The benefit of pre-fetching file Gi immediately is defined tobe the expected number of seconds saved by such a pre-fetch, as comparedto a situation where Gi is left to be retrieved later (either by a laterpre-fetch, or by the user's request) if at all. The cost of pre-fetchingfile Gi immediately is defined to be the expected cost for proxy serverS to retrieve file Gi, as determined for example by the networklocations of server S and file Gi and by information provider charges,times 1 minus the probability that proxy server S will have to retrievefile Gi within t minutes (to satisfy either a later pre-fetch or theuser's explicit request) if it is not pre-fetched now.

The above definitions of cost and benefit have some attractiveproperties. For example, if users tend to retrieve either file F1 orfile F2 (say) after file F, and tend only in the former case tosubsequently retrieve file G1, then the system will generally notpre-fetch G1 immediately after retrieving file F: for, to the extentthat the user is likely to retrieve file F2, the cost of the pre-fetchis high, and to the extent that the user is likely to retrieve file F1instead, the benefit of the pre-fetch is low, since the system can saveas much or nearly as much time by waiting until the user chooses F1 andpre-fetching G1 only then.

The proxy server S may estimate the necessary costs and benefits byadhering to the following discipline:

1. Proxy server S maintains a set of disjoint clusters of the users inits user base, clustered according to their user profiles.

2. Proxy server S maintains an initially empty set PFT of “pre-fetchtriples” <C,F,G>, where F and G are files, and where C identifies eithera cluster of users or the set of all users in the user base of proxyserver S. Each pre-fetch triple in the set PFT is associated withseveral stored values specific to that triple. Pre-fetch triples andtheir associated values are maintained according to the rules in 3 and4.

3. Whenever a user U in the user base of proxy server S makes a requestR2 for a file G, or a request R2 that triggers file G, then proxy serverS takes the following actions:

a. For C being the user cluster containing user U, and then again for Cbeing the set of all users:

b. For any request R0 for a file, say file F, made by user U during thet minutes strictly prior to the request R2:

c. If the triple <C,F,G> is not currently a member of the set PFT, it isadded to the set PFT with a count of 0, a trigger-count of 0, atarget-count of 0, a total benefit of 0, and a timestamp whose value isthe current date and time.

d. The count of the triple <C,F,G> is increased by one.

e. If file G was not triggered or explicitly retrieved by any requestthat user U made strictly in between requests R0 and R2, then thetarget-count of the triple <C,F,G> is increased by one.

f. If request R2 was a request for file G, then the total benefit oftriple <C,F,G> is increased either by the time elapsed between requestR0 and request R2, or by the expected time to retrieve file G, whicheveris less.

g. If request R2 was a request for file G, and G was triggered orexplicitly retrieved by one or more requests that user U made strictlyin between requests R0 and R2, with R1 denoting the earliest suchrequest, then the total benefit of triple <C,F,G> is decreased either bythe time elapsed between request RI and request R2, or by the expectedtime to retrieve file G, whichever is less.

4. If a user U requests a file F, then the trigger-count is incrementedby one for each triple currently in the set PFT such that the triple hasform <C,F,G>, where user U is in the set or cluster identified by C.

5. The “age” of a triple <C,F,G> is defined to be the number of dayselapsed between its timestamp and the current date and time. If the ageof any triple <C,F,G> exceeds a fixed constant number of days, and alsoexceeds a fixed constant multiple of the triple's count, then the triplemay be deleted from the'set PFT.

Proxy server. S can therefore decide rapidly which files G should betriggered by a request for a given file F from a given user U, asfollows.

1. Let CO be the user cluster containing user U, and Cl be the set ofall users.

2. Server S constructs a list L of all triples <C0,F,G> such that<C0,F,G> appears in set PFT with a count exceeding a fixed threshold.

3. Server S adds to list L all triples <C1,F,G> such that <C0,F,G> doesnot appear on list L and <C1,F,G> appears in set PFT with a countexceeding another fixed threshold.

4. For each triple <C,F,G> on list L:

5. Server S computes the cost of triggering file G to be expected costof retrieving file Gi, times 1 minus the quotient of the target-count of<C,F,G> by the trigger-count of <C,F,G>.

6. Server S computes the benefit of triggering file G to be the totalbenefit of <C,F,G> divided by the count of <C,F,G>.

7. Finally, proxy server. S uses the computed cost and benefit, asdescribed earlier, to decide whether file G should be triggered. Theapproach to pre-fetching just described has the advantage that all datastorage and manipulation concerning pre-fetching decisions by proxyserver S is handled locally at proxy server S. However, this“user-based” approach does lead to duplicated storage and effort acrossproxy servers, as well as incomplete data at each individual proxyserver. That is, the information indicating what files are frequentlyretrieved after file F is scattered in an uncoordinated way acrossnumerous proxy servers. An alternative, “file-based” approach is tostore all such information with file F itself The difference is asfollows. In the user-based approach, a pre-fetch triple <C,F,G> inserver S's set PFT may mention any file F and any file G on the network,but is restricted to clusters C that are subsets of the user base ofserver S. By contrast, in the file-based approach, a pre-fetch triple<C,F,G> in server S's set PFT may mention any user cluster C and anyfile G on the network, but is restricted to files F that are stored onserver S. (Note that in the file-based approach, user clustering isnetwork wide, and user clusters may include users from different proxyservers.) When a proxy server S2 sends a request to server S to retrievefile F for a user U server S2 indicates in this message the user U'suser cluster C0, as well as the user U's value for the user-determinedmultiplier that is used in cost-benefit analysis. Server S can use thisinformation, together with all its triples in its set PFT of the form<C0,F,G> and <C1,F,G>, where C1 is the set of all users everywhere onthe network, to determine (exactly as in the user-based approach) whichfiles G1 . . . Gk are triggered by the request for file F. When server Ssends file F back to proxy server S2, it also sends this list of filesG1 . . . Gk, so that proxy server S2 can proceed to pre-fetch files G1 .. . Gk.

The file-based approach requires some additional data transmission.Recall that under the user-based approach, server S must execute steps 3c-3 g above for any ordered pair of requests R0 and R2 made within tminutes of each other by a user who employs server S as a proxy server.Under the file-based approach, server S must execute steps 3 c-3 g abovefor any ordered pair of requests R0 and R2 made within t minutes of eachother, by any user on the network, such that R0 requests a file storedon server S. Therefore, when a user makes a request R2, the user's proxyserver must send a notification of request R2 to all servers S suchthat, during the preceding t minutes (where the variable t may nowdepend on server S), the user has made a request R0 for a file stored onserver S. This notification need not be sent immediately, and it isgenerally more efficient for each proxy server to buffer up suchnotifications and send them periodically in groups to the appropriateservers.

Access And Reachability Control of Users and User-Specific Information

Although users true identities are protected by the use of secure mixpaths, pseudonymity does not guarantee complete privacy. In particular,advertisers can in principle employ user-specific data to barrage userswith unwanted solicitations. The general solution to this problem is forproxy server S2 to act as a representative on behalf of each user in itsuser base, permitting access to the user and the user's private dataonly in accordance with criteria that have been set by the user. Proxyserver S2 can restrict access in two ways:

1. The proxy server S2 may restrict access by third parties to serverS2's pseudonymous database of user-specific information. When a thirdparty such as an advertiser sends a message to server S2 requesting therelease of user-specific information for a pseudonym P, server S2refuses to honor the request unless the message includes credentials forthe accessor adequate to prove that the accessor is entitled to thisinformation. The user associated with pseudonym P may at any time sendsigned control messages to proxy server S2, specifying the credentialsor Boolean combinations of credentials that proxy server S2 shouldthenceforth consider to be adequate grounds for releasing a specifiedsubset of the information associated with pseudonym P. Proxy server S2stores these access criteria with its database record for pseudonym P.For example, a user might wish to proxy server S2 to release purchasinginformation only to selected information providers, to charitableorganizations (that is, organizations that can provide agovernment-issued credential that is issued only to registeredcharities), and to market researchers who have paid user U for the rightto study user U's purchasing habits.

2. The proxy server S2 may restrict the ability of third parties to sendelectronic messages to the user. When a third party such as anadvertiser attempts to send information: (such as a textual message or arequest to enter into spoken or written realtime communication) topseudonym P, by sending a message to proxy server S2 requesting proxyserver S2 to forward the information to the user at pseudonym P, proxyserver S2 will refuse to honor the request, unless the message includescredentials for the accessor adequate to meet the requirements the userhas chosen to impose, as above, on third parties who wish to sendinformation to the user. If the message does include adequatecredentials, then proxy server S2 removes a single-use pseudonymousreturn address envelope from it s database record for pseudonym P, anduses the envelope to send a message containing the specified informationalong a secure mix path to the user of pseudonym P. If the envelopebeing used is the only envelope stored for pseudonym P, or moregenerally if the supply of such envelopes is low, proxy server S2 adds anotation to this message before sending it, which notation indicates tothe user's local server that it should send additional envelopes toproxy server S2 for future use.

In a more general variation, the user may instruct the proxy server S2to impose more complex requirements on the granting of requests by thirdparties, not simply boolean combinations of required credentials. Theuser may impose any Boolean combination of simple requirements that mayinclude, but are not limited to, the following:

(a.) the accessor (third party) is a particular party

(b.) the accessor has provided a particular credential

(c.) satisfying the request would involve disclosure to the accessor ofa certain fact about the user's user profile

(d.) satisfying the request would involve disclosure to the accessor ofthe user's target profile interest summary

(e.) satisfying the request would involve disclosure to the accessor ofstatistical summary data, which data are computed from the user's userprofile or target profile interest summary together with the userprofiles and target profile interest summaries of at least n other usersin the user base of the proxy server

(f.) the content of the request is to send the user a target object, andthis target object has a particular attribute (such as high readinglevel, or low vulgarity, or an authenticated Parental Guidance ratingfrom the MPAA)

(g.) the content of the request is to send the user a target object, andthis target object has been digitally signed with a particular privatekey (such as the private key used by the National PharmaceuticalAssociation to certify approved documents)

(h.) the content of the request is to send the user a target object, andthe target profile has been digitally signed by a profile authenticationagency, guaranteeing that the target profile is a true-and accurateprofile of the target object it claims to describe, with all attributesauthenticated

(i.) the content of the request is to send the user a target object, andthe target profile of this target object is within a specified distanceof a particular search profile specified by the user

(j.) the content of the request is to send the user a target object, andthe proxy server S2, by using the user's stored target profile interestsummary, estimates the user's likely interest in the target object to beabove a specified threshold

(k.) the accessor indicates its willingness to make a particular paymentto the user in exchange for the fulfillment of the request

The steps required to create and maintain the user's access-controlrequirements re as follows:

1. The user composes a boolean combination of predicates that apply torequests; the resulting complex predicate should be true when applied toa request that the user wants proxy server S2 to honor, and falseotherwise. The complex predicate may be encoded in another form, forefficiency.

2. The complex predicate is signed with SK_(P), and transmitted from theuser's client processor C3 to the proxy server S2 through the mix pathenclosed in a packet that also contains the user's pseudonym P.

3. The proxy server S2 receives the packet, verifies its authenticityusing PK_(P) and: stores the access control instructions specified inthe packet as part of its database record for pseudonym P.

The proxy server S2 enforces access control as follows:

1. The third party (accessor) transmits a request to proxy server S2using the normal point-to-point connections provided by the network N.The request may be to access the target profile interest summariesassociated with a set of pseudonyms P1 . . . Pn, or to access the userprofiles associated with a set of pseudonyms P1 . . . Pn, or to forwarda message to the users associated with pseudonyms P1 . . . Pn. Theaccessor may explicitly specify the pseudonyms P1 . . . Pn, or may askthat P1 . . . Pn be chosen to be the set of all pseudonyms registeredwith proxy server S2 that meet specified conditions.

2. The proxy server S2 indexes the database record for each pseudonym Pi(1<=I<=n), retrieves the access requirements provided by the userassociated with Pi, and determines whether and how the transmittedrequest should be satisfied for Pi. If the requirements are satisfied,S2 proceeds with steps 3 a-3 c.

3a. If the request can be satisfied but only upon payment of a fee, theproxy server S2 transmits a payment request to the accessor, and waitsfor the accessor to send the payment to the proxy server S2. Proxyserver S2 retains a service fee and forward s the balance of the paymentto the user associated with pseudonym Pi, via an anonymous return packetthat this user has provided.

3b. If the request can be satisfied but only upon provision of acredential, the proxy server S2 transmits a credential request to theaccessor, and waits for the accessor to send the credential to the proxyserver S2.

3c. The proxy server S2 satisfies the request by disclosinguser-specific information to the accessor, by providing the accessorwith a set of single-use envelopes to communicate directly with theuser, or by forwarding a message to the user, as requested.

4. Proxy server S2 optionally sends a message to the accessor,indicating why each of the denied requests for P1 . . . Pn was denied,and/or indicating how many requests were satisfied.

5. The active and/or passive relevance feedback provided by any user Uwith respect to any target object sent by any path from the accessor istabulated by the above-described tabulating process resident on user U'sclient processor C3. As described above, a summary of such informationis periodically transmitted to the proxy server S2 to enable the proyserver S2 to update that user's target profile interest summary and userprofile.

The access control criteria can be applied to solicited as well asunsolicited transmissions. That is, the proxy server can: be used toprotect the user from inappropriate or misrepresented target objectsthat the user may request. If the user requests a target object from aninformation server, but the target object turns out not to meet theaccess control criteria, then the proxy server will not permit theinformation server to transmit the target object to the user, or tocharge the user for such. transmission. For example, to guard againsttarget objects whose profiles have been tampered with, the user mayspecify an access control criterion that requires' the provider to provethe target profile's accuracy by means of a digital signature from aprofile authentication agency. As another example, the parents of achild user may instruct the proxy server that only target objects thathave been digitally signed by a recognized child protection organizationmay be transmitted to the user; thus, the proxy server will not let theuser retrieve pornography, even from a rogue information server that iswilling to provide pornography to users who have not supplied anadulthood credential.

Distribution of Information with Multicast Trees

The graphical representation of the network N presented in FIG. 3 showsthat at least one of the data communications links can be eliminated, asshown in FIG. 4, while still enabling the network N to transmit messagesamong all the servers A-D. By elimination, we mean that the link isunused in the logical design of the network, rather than a physicaldisconnection of the link. The graphs that result when all redundantdata communications links are eliminated are termed “trees” or“connected acyclic graphs.” A graph where a message could be transmittedby a server through other servers and then return to the transmittingserver over a different originating data communications link is termed a“cycle.” A tree is thus an acyclic graph whose edges (links) connect aset of graph “nodes” (servers). The tree can be used to efficientlybroadcast any data file to selected servers in a set of interconnectedservers.

The tree structure is attractive in a communications network becausemuch information distribution is multicast in nature—that is, a piece ofinformation available at a single source must be distributed to amultiplicity of points where the information can be accessed. Thistechnique is widely known: for example, “FAX trees” are in common use inpolitical organizations, and multicast trees are widely used indistribution of multimedia data in the Internet; for example, see“Scalable Feedback Control for Multicast Video Distribution in theInternet,” (Jean—Chrysostome Bolot, Thierry Turletti, &: Ian Wakeman,Computer Communication Review, Vol. 24, #4, October '94, Proceedings of.SIGCOMM'94, pp. 58-67) or “An Architecture For Wide-Area MulticastRouting,” (Stephen Deering, Deborah Estrin, Dino Farinacci, VanJacobson, Ching-Gung Liu, & Liming Wei, Computer Communication Review,Vol. 24, #4, October '94, Proceedings of SIGCOMM'94, pp. 126-135). Whilethere are many possible trees that can be overlaid on a graphrepresentation of a network, both the nature of the networks (e.g., thecost of transmitting data over a link) and their use (for example,certain nodes may exhibit more frequent intercommunication) can make onechoice of tree better than another for use as a multicast tree. One ofthe most difficult problems in practical network design is theconstruction of “good” multicast trees, that is, tree choices whichexhibit low cost (due to data not traversing links unnecessarily) andgood performance (due to data frequently being close to where it isneeded)

Constructing a Multicast Tree

Algorithms for constructing multicast trees have either been ad-hoc, asis the case of the Deering, et al. Internet multicast tree, which addsclients as they request service by grafting them into the existing tree,or by construction of a minimum cost spanning tree. A distributedalgorithm for creating a spanning tree (defined as a tree that connects,or “spans,” all nodes of the graph) on a set of Ethernet bridges wasdeveloped by Radia Perlman (“Interconnections: Bridges and Routers,”Radia Perlman, Addison-Wesley, 1992). Creating a minimal-cost spanningtree for a graph depends on having a cost model for the arcs of thegraph (corresponding to communications 1 inks in the communicationsnetwork). In the case of Ethernet bridges, the default cost (morecomplicated costing models for path costs are discussed on pp. 72-73 ofPerlman) is calculated as a simple distance measure to the root; thusthe spanning tree minimizes the cost to the root by first electing aunique root and then constructing a spanning tree based on the distancesfrom the root. In this algorithm, the root is elected by recourse to anumeric ID contained in “configuration messages.”: the server w hose IDhas minimum numeric value is chosen as the root. Several problems existwith this algorithm in general. First, the method of using an ID doesnot necessarily select the best root for the nodes interconnected in thetree. Second, the cost model is simplistic.

We first show how to use the similarity-based methods described above toselect the servers most interested in a group of target objects, hereintermed “core servers” for that group. Next we show how to construct anunrooted multicast tree that can be used to broadcast files to thesecore servers. Finally, we show how files corresponding to target objectsare actually broadcast through the multicast tree at the initiative of aclient, and how these files are later retrieved from the core serverswhen clients request them.

Since the choice of core servers to distribute a file to depends on theset of users who are likely to retrieve the file (that is, the set ofusers who are likely to be interested in the corresponding targetobject), a separate set of core servers and hence a separate multicasttree may be used for each topical group of target objects. Throughoutthe description below, servers may communicate among themselves throughany path over which messages can travel; the goal: of each multicasttree is to optimize the multicast distribution of files corresponding totarget objects of the corresponding topic, Note that this problem iscompletely distinct from selecting a multiplicity of spanning trees forthe complete set of interconnected nodes as disclosed by Sincoskie inU.S. Pat. No. 4,706,080 and the publication titled “Extended BridgeAlgorithms for Large Networks” by W. D. Sincoskie and C. J. Cotton,published January 1988 in IEEE Network on pages 16-24. The trees in thisdisclosure are intentionally designed to interconnect a selected subsetof nodes in the system, and are successful to the degree that thissubset is relatively small.

Multicast Tree Construction Procedure

A set of topical multicast trees for a set of homogenous target objectsmay be constructed or reconstructed at any time, as follows. The set oftarget objects is grouped into a fixed number of topical clusters C1 . .. Cp with the methods described above, for example, by choosing C1 . . .Cp to be the result of a k-means clustering of the set of targetobjects, or alternatively a covering set of low-level clusters from ahierarchical cluster tree of these target objects. A multicast treeMT(c) is then constructed from each cluster C in C1 . . . Cp, by thefollowing procedure:

1. Given a set of proxy servers, S1 . . . Sn, and a-topical cluster C.It is assumed that a general multicast tree MT_(full) that contains allthe proxy servers S1 . . . Sn has previously been constructed bywell-known methods.

2. Each pair <Si, C> is associated with a weight, w(Si, C), which isintended to covary with the expected number of users in the user base ofproxy server Si who will subsequently access a target object fromcluster C. This weight is computed by proxy server Si in any of severalways, all of which make use of the similarity measurement computationdescribed herein.

One variation makes use of the following steps: (a) Proxy server Sirandomly selects a target object T from cluster C. (b) For eachpseudonym in its local database, with associated user U, proxy server Siapplies the techniques disclosed above to user U's stored user profileand target profile interest summary in order to estimate the interestw(U, T) that user U has in the selected target object T. The aggregateinterest w(Si, T) that the user base of proxy server Si has in thetarget object T is defined to be the sum of these interest values w(U,T). Alternatively, w(Si, T) may be defined to be the sum of valuess(w(U, T)) over all U in the user base. Here s(*) is a sigmoidalfunction that is close to 0 for small arguments and close to a constantp_(max) for large arguments; thus s(w(U, T)) estimates the probabilitythat user U will access target object T, which probability is assumed tobe independent of the probability that any other user will access targetobject T. In a variation, w(Si, T) is made to estimate the probabilitythat at least one user from the user base of Si will access targetobject T: then w(Si, T) may be defined as the maximum of values w(U, T),or of 1 minus the product over the users U of the quantity (1−s(w(U,T))). (c)Proxy server Si repeats steps (a)-(b) for several targetobjects T selected randomly from cluster C, and averages the severalvalues of w(Si, T) thereby computed in step (b) to determine the desiredquantity w(Si, C), which quantity represents the expected aggregateinterest by the user base of proxy server Si in the target objects ofcluster C.

In another variation, where target profile interest summaries areembodied as search profile sets, the following procedure is followed tocompute w(Si, C): (a). For each search profile P_(S) in the locallystored search profile set of any user in the user base of proxy serverSi, proxy server Si computes the distance d(P_(S), P_(C)) between thesearch profile and the cluster-profile P_(C) of cluster C. (b) w(Si,C)is chosen to be the maximum value of (−d(P_(S),P_(C))/r) across all suchsearch profiles P_(S), where r is computed as an affine function of thecluster diameter of cluster C. The slope and/or intercept of this affinefunction are chosen to be smaller (thereby increasing w(Si, C)) forservers Si for which the target object provider wishes to improveperformance, as may be the case if the users in the user base of proxyserver Si pay a premium for improved performance, or if performance atSi will otherwise be unacceptably low due to slow network connections.

In another variation, the proxy server Si is modified so that itmaintains not only target profile interest summaries for each user inits user base, but also a single aggregate target profile interestsummary for the entire user base. This aggregate target profile interestsummary is determined in the usual way from relevance feedback, but therelevance feedback on a target object, in this case, is considered to bethe frequency with which users in the user base retrieved the targetobject when it was new. Whenever a user retrieves a target object bymeans of a request to proxy server Si, the aggregate target profileinterest summary for proxy server Si is updated. In this variation,w(Si, C) I estimated by the following steps:

(a) Proxy server Si randomly selects a target object T-from cluster C.

(b) Proxy server Si applies the techniques disclosed above to its storedaggregate target profile interest summary in order to estimate theaggregate interest w(Si, T) that its aggregated user base had in theselected target object T, when new; this may be interpreted as anestimate of the likelihood that at least one member of the user basewill retrieve a new target object similar to T.

(c) Proxy server Si repeats steps (a)-(b) for several target objects Tselected randomly from cluster C, and averages the several values ofw(Si, T) thereby computed in step (b) to determine the desired quantityw(Si, C), which quantity represents the expected aggregate interest bythe user base of proxy server Si in the target objects of cluster C.

3. Those servers Si from among S1 . . . Sn with the greatest weightsw(Si, C) are designated “core servers” for cluster C. In one variation,where it is desired to select a fixed number of core servers, thoseservers Si with the greatest values of w(Si, C) are selected. In anothervariation, the value of w(Si, C) for each server Si is compared againsta fixed threshold w_(min), and those servers Si such that w(Si, C)equals or exceeds w_(min) are selected as core servers. If cluster Crepresents a narrow and specialized set of target objects, as oftenhappens when the clusters C1 . . . Cp are numerous, it is usuallyadequate to select only small number of core server cluster C, therebyobtaining substantial advantages in computational efficiency in steps4-5 below

4. A complete graph G(C) is constructed whose vertices are thedesignated core servers for cluster C. For each pair of core servers,the cost of transmitting a message between those core servers along thecheapest path is estimated, and the weight of the edge connecting thosecore servers is taken to be this cost. The cost is determined as asuitable function of average transmission charges, average transmissiondelay, and worst-case or near-worst-case transmission delay.

5. The multicast tree MT(C) is computed by standard methods to be theminimum spanning tree (or a near-minimum spanning tree) for G(C), wherethe weight of an edge between two core servers is taken to be the costof transmitting a message between those two core servers. Note thatMT(C) does not contain as vertices all proxy servers S1 . . . Sn, butonly the core servers for cluster C.

6. A message M is formed describing the cluster profile for cluster C,the core servers for cluster C and the topology of the multicast treeMT(C) constructed on those core servers. Message M is broadcast to allproxy servers S1 . . . Sn by means of the general multicast treeMT_(full). Each proxy server Si, upon receipt of message M, extracts thecluster profile of cluster C, and stores it on a local storage device,together with certain other information that it determines from messageM, as follows. If proxy server Si is named in message M as a core serverfor cluster C, then proxy server Si extracts and stores the subtree ofMT(C) induced by all core servers whose path distance from Si in thegraph MT(C) is less than or equal to d, where d is a constant positiveinteger. (usually from 1 to 3). If message M does not name proxy serverSi as a core server for MT(C), then proxy server Si extracts and storesa list of one or more nearby core servers that can be inexpensivelycontacted by proxy server Si over virtual point-to-point links.

In the network of FIG. 3, to illustrate the use of trees, as applied tothe system of the present invention, consider the following simpleexample where it is assumed that client r provides on-line informationfor the network, such as an electronic newspaper. This information canbe structured by client r into a prearranged form, comprising a numberof files, each of which is associated with a different target object. Inthe case of an electronic newspaper, the files can contain textualrepresentations of stock prices, weather forecasts, editorials, etc. Thesystem determines likely demand for the target objects associated withthese files in order to optimize the distribution of the files throughthe network N of interconnected clients p-s and proxy servers A-D.Assume that cluster C consists of text articles relating to theaerospace industry; further assume that the target profile interestsummaries stored at proxy servers A and B for the users at clients p andr indicate that these users are strongly interested in such articles.Then the proxy servers A and B are selected as core servers for themulticast tree MT(C). The multicast tree MT(C) is then computed to:consist of the core servers, A and B, connected by an edge thatrepresents the least costly virtual point-to-point link between A and B(either the direct path A-B or the indirect path A-C-B, depending on thecost).

Global Requests to Multicast Trees

One type of message that may be transmitted to any proxy server S istermed a “global request message.” Such a message M triggers thebroadcast of an embedded request R to all core servers in a multicasttree MT(C). The content of request R and the identity of cluster C areincluded in the message M, as is a field indicating that message M is aglobal request message. In addition, the message M contains a fieldSi_(last) which is unspecified except under certain circumstancesdescribed below, when it names a specific core server. A global requestmessage M may be transmitted to proxy server S by a user registered withproxy server S which transmission may take place along a pseudonymousmix path, or it may be transmitted to proxy server S from another proxyserver, along a virtual point-to-point connection.

When a proxy server S receives a, message M that is marked as a globalrequest message, it acts as follows: 1. If proxy server S is not a coreserver for topic C, it retrieves its locally stored list of nearby coreservers for topic C, selects from this list a nearby core server S′, andtransmits a copy of message M over a virtual point-to-point connectionto core server S′. If this transmission fails, proxy server S repeatsthe procedure with other core servers on its list. 2. If proxy server Sis a core server for topic C, it executes the following steps: (a) Acton the request R that is embedded in message M. (b) Set S_(curr) to beS(C) Retrieve the locally stored subtree of MT(C), and extract from it alist L of all core servers that are directly linked to S_(curr) in thissubtree. (d) If the message M specifies a value for S_(last and S)_(last) appears on the list L, remove S_(last) from the list L. Notethat list L may be empty before this step, or may become empty as aresult of this step. (e) For each server Si in list L, transmit a copyof message M from server S to server Si over a virtual point-to-pointconnection, where the S_(last) field of the copy of message M has beenaltered to S_(curr). If Si cannot be reached in a reasonable amount oftime by any virtual point-to-point connection (for example, server Si isbroken), recurse to step (c) above with S_(orig) bound to S_(curr) andS_(curr) bound to S{\sub I} for the duration of the recursion.

When server S′ in step 1 or a server Si in step 2(e) receives a copy ofthe global request message M, it acts according to exactly the samesteps. As a result, all core servers eventually receive a copy of globalrequest message M and act on the embedded request R, unless some coreservers cannot be reached. Even if a core server is unreachable, step(e) ensures that the broadcast can continue to other core servers inmost circumstances, provided that d>1; higher values of d provideadditional insurance against unreachable core servers.

Multicasting Files

The system for customized electronic information of desirable objectsexecutes the following steps in order to introduce a new target objectinto the system. These steps are initiated by an entity E, which may beeither a user entering commands via a keyboard at a client processor q,as illustrated in FIG. 3, or an automatic software process resident on aclient or server processor q. 1. Processor q forms a signed request R,which asks the receiver to store a copy of a file F on its local storagedevice. File F, which is maintained by client q on storage at client qor on storage accessible by client q over the network, contains theinformational content of or an identifying description of a targetobject, as described above. The request R also includes an address atwhich entity E may be contacted (possibly a pseudonymous address at someproxy server D), and asks the receiver to store the fact that file F ismaintained by an entity at said address. 2. Processor q embeds request Rin a message M1, which it pseudonymously transmits to the entity E'sproxy server D as described above. Message M1 instructs proxy server Dto broadcast request R along an appropriate multicast tree. 3. Uponreceipt of message M1, proxy server D examines the doubly embedded fileF and computes a target profile P for the corresponding target object.It compares the target profile P to each of the cluster profiles fortopical clusters C1 . . . Cp described above, and chooses Ck to be thecluster with the smallest similarity distance to profile P. 4. Proxyserver D sends itself a global request message M instructing itself tobroadcast request R along the topical multicast tree MT(Ck). 5. Proxyserver D notifies entity E through a pseudonymous communication thatfile F has been multicast along the topical multicast tree for clusterCk. As a result of the procedure that server D and other servers followfor acting on global request messages, step 4 eventually causes all coreservers for topic Ck to act on request R and therefore store a localcopy of file F. In order to make room for file F on its local storagedevice, a core server Si may have to delete a less usefull file. Thereare several ways to choose a file to delete. One option, well known inthe art, is for Si to choose to delete the least recently accessed file.In another variation, Si deletes a file that it believes few users willaccess. In this variation, whenever a server Si stores a copy of a fileF, it also computes and stores the weight w(Si, C_(F)), where C_(F) is acluster consisting of the single target object associated with file F.Then, when server Si needs to delete a file, it chooses to delete thefile F with the lowest weight w(Si, C_(F)). To reflect the fact thatfiles are accessed less as they age, server Si periodically multipliesits stored value of w(Si, C_(F)) by a decay factor, such as 0.95, foreach file F that it then stores. Alter natively, instead of using adecay factor, server Si may periodically recompute aggregate interestw(Si, C_(F)) for each file F that it stores; the aggregate interestchanges over time because target objects typically have an age attributethat the system considers in estimating user interest, as describedabove.

If entity E later wishes to remove file F from the network, for examplebecause it has just multicast an updated version, it pseudonymouslytransmits a digitally signed global request message to proxy-server D,requesting all proxy servers in the multicast tree MT(Ck) to delete anylocal copy Qf file F that they may be, storing.

Oueries to Multicast Trees

In addition to global request messages, another type of message that maybe transmitted to any proxy server S is termed a “query message.” Whentransmitted to a proxy server, a query message causes a reply to be sentto the originator of the message, this reply will contain an answer to agiven query Q if any of the servers in a given multicast tree MT(C) areable to answer it, and will otherwise indicate that no answer isavailable. The query and the cluster C are named in the query message.In addition, the query message contains a field S_(last) which isunspecified except under certain circumstances described below, when itnames a specific core server. When a proxy server S receives a message Mthat is marked as a query message, it acts as follows: 1. Proxy server Ssets A_(r) to be the return address for the client or server thattransmitted message M to server S. A_(r) may be either a network addressor a pseudonymous address 2. If proxy server S is not a core server forcluster C, it retrieves its local stored list of nearby core servers fortopic C, selects from this list a nearby core server S′, and transmits acopy of the locate message M over a virtual point-to-point connection tocore server S′. If this transmission fails, proxy server S repeats theprocedure with other core servers on its list. Upon receiving a reply,it forwards this reply to address A_(r). 3. If proxy server S is a coreserver for cluster C, and it is able to answer query Q using locallystored information, then it transmits a “positive” reply to A_(r)containing the answer. 4. If proxy server S is a core server for topicC, but it is unable to answer query Q using locally stored information,then it carries out a parallel depth-first search by executing thefollowing steps: (a) Set L to be the empty list. (b) Retrieve thelocally stored subtree of MT(C). For each server Si directly linked toS_(curr) in this subtree, other than S_(last) (if specified), add theordered pair (Si, S) to the list L. (c) If L is empty, transmit a“negative” reply to address A_(r), saying that server S cannot locate ananswer to query Q, and terminate the execution of step 4; otherwiseproceed to step (d). (d) Select a list L1 of one or more server pairs(Ai, Bi) from the list L. For each server pair (Ai, Bi) on the list L1,form a locate message M(Ai, Bi), which is a copy of message M whoseS_(last) field has been modified to specify Bi, and transmit thismessage M(Ai, Bi) to server Ai over a virtual point-to-point connection.(e) For each reply received (by S) to a message sent in step (d), act asfollows: (I) If a “positive” reply arrives to allocate message M(Ai,Bi), then forward this reply to A_(r) and terminate step 4, immediately.(ii) If a “negative” reply arrives to a locate message M(Ai, Bi), thenremove the pair (Ai, Bi) from the list L1. (iii) If the message M(Ai,Bi) could not be successfully delivered to Ai, then remove the pair (Ai,Bi) from the list L1, and add the pair (Ci, Ai) to the list L1 for eachCi other than Bi that is directly linked to Ai in the locally storedsubtree of MT(C). (f) Once L1 no longer contains any pair (Ai, Bi) forwhich a message M(Ai, Bi) has been sent, or after a fixed period of timehas elapsed, return to step (c).

Retrieving Files from a Multicast Tree

When a processor q in the network wishes to retrieve the file associatedwith a given target object, it executes the following steps. These,stepsare initiated by anentity E, which may be either a user enteringcommands via a keyboard at a client q, as illustrated in FIG. 3, or anautomatic software process resident on a client or server processorq. 1. Processor q forms a query Q that asks whether the recipient (acore server for cluster C) still stores a file F that was previouslymulticast to the multicast tree MT(C); if so, the recipient servershould reply with its own server name Note that processor q must alreadyknow the name of file F and the identity of cluster C; typically, thisinformation is provided to entity E by a service such as the newsclipping service or browsing system described below, which must identifyfiles to the user by (name, multicast topic) pair. 2. Processor q formsa query message M that poses query Q to the multicast tree MT(C). 3.Processor q pseudonymously transmits message M to the user's proxyserver D, as described above. 4. Processor q receives a response M2 tomessage M. 5. If the response M2 is “positive,” that is, it names aserver S that still stores file F, then processor q pseudonymouslyinstructs the user's proxy server D to retrieve file F from server S. Ifthe retrieval fails because server S has deleted file F since itanswered the query, then client q returns to step 1. 6. If the responseM2 is “negative,” that is, it indicates that no server in MT(C) stillstores file F, then processor q forms a query Q that asks the recipientfor the address A of the entity that maintains file F; this entity willordinarily maintain a copy of file F indefinitely. All core servers inMT(C) ordinarily retain this information (unless instructed to delete itby the maintaining entity), even if they delete file F for spacereasons. Therefore, processor q should receive a response providingaddress A, whereupon processor q pseudonymously instructs the user'sproxy server D to retrieve file F from address A.

When multiple versions of a file F exist on local servers throughout thedata communication network N, but are not marked as alternate versionsof the same file, the system's ability to rapidly locate files similarto F (by treating them as target objects and applying the methodsdisclosed in “Searching for TargetObjects” above) makes it possible tofind all the alternate versions, even if they are stored remotely. Theserelated data files may then be reconciled by any method. In a simpleinstantiation, all versions of the data file would be replaced with theversion that had the latest date or version number. In anotherinstantiation, each version would be automatically annotated withreferences or pointers to the other versions.

NEWS CLIPPING SERVICE

The system for customized electronic identification of desirable objectsof the present invention can be used in the electronic media system ofFIG. 1 to implement an automatic news clipping service which learns toselect (filter) news articles to match a user's interests, based solelyon which articles the user chooses to read. The system for customizedelectronic identification of desirable objects generates a targetprofile for each article that enters the electronic media system, basedon the relative frequency of occurrence of the words contained in thearticle. The system for customized electronic identification ofdesirable objects also generates a search profile set for each user, asa function of the target profiles of the articles the user has accessedand the relevance feedback the user has provided on these articles. Asnew articles are received for storage on the mass storage systemsSS₁-SS_(m) of the information servers I₁-I_(m), the system forcustomized electronic identification of desirable objects generatestheir target profiles. The generated target profiles are later comparedto the search profiles in the users' search profile sets, and those newarticles whose tar get profiles' are closest (most similar) to theclosest search profile in a user's search profile set are identified tothat user for possible reading. The computer program providing thearticles to the user monitors how much the user reads (the number ofscreens of data and the number of minutes spent reading), and adjuststhe search profiles in the user's search profile set to more closelymatch what the user apparently prefers to read. The details of themethod used by this system are disclosed in flow diagram form in FIG. 5.This method requires selecting a specific method of calculatinguser-specific search profile sets, of measuring similarity between twoprofiles, and of updating a user's search profile 'set (or moregenerally target profile interest summary) based on what the user read,and the examples disclosed herein are examples of the many possibleimplementations that can be used and should not be construed to limitthe scope of the system.

Initialize Users' Search Profile Sets

The news clipping service instantiates target profile interest summariesas search profile sets, so that a set of high-interest search profilesis stored for each user. The search profiles associate d with a givenuser change over time. As in any application involving search profiles,they can be initially determined for a new user (or explicitly alteredby an existing user) by any of a number of procedures, including thefollowing preferred methods: (1) asking the user to specify searchprofiles directly by giving keywords and/or numeric attributes, (2)using copies of the profiles of target objects or target clusters thatthe user indicates are representative of his or her interest, (3) usinga standard set of search profiles copied or otherwise determined fromthe search profile sets of people who are demographically similar to theuser.

Retrieve New Articles from Article Source

Articles are available on-line from a wide variety of sources. In thepreferred embodiment, one would use the current days news as supplied bya news source, such as the AP or Reuters news wire. These news articlesare input to the electronic media system by being loaded into the massstorage system SS₄ of an information server S₄. The article profilemodule 201 of the system for customized electronic identification ofdesirable objects can reside on the information server S₄ and operatespursuant to the steps illustrated in the flow diagram of FIG. 5, where,as each article is received at step 501 by the information server. S₄,the article profile module 201 at step 502 generates a target profilefor the article and stores the target profile in an article indexingmemory (typically part of mass storage system SS₄ for later use inselectively delivering articles to users. This method is equally usefulfor selecting which articles to read from electronic news groups andelectronic bulletin boards, and can be used as part of a system forscreening and organizing electronic mail (“e-mail”).

Calculate Article Profiles

A target profile is computed for each new article, as described earlier.The most important attribute of the target profile is a textualattribute that stands for the entire text of the article. This textualattribute is represented as described earlier, as a vector of numbers,which numbers in the preferred embodiment include the relativefrequencies (TF/IDF scores) of word occurrences in this article relativeto other comparable articles. The server must count the frequency ofoccurrence of each word in the article in order to compute the TF/IDFscores.

These news articles are then hierarchically clustered in a hierarchicalcluster tree at step 503, which serves as a decision tree fordetermining which news articles are closest to the user's interest. Theresulting clusters can be viewed as a tree in which the top of the treeincludes all target objects and branches further down the tree representdivisions of the set of target objects into successively smallersubclusters of target objects. Each cluster has a cluster profile, sothat at each node of the tree, the average target profile (centroid) ofall target objects stored in the subtree rooted at that node is stored.This average of target profiles is computed over the representation oftarget profiles as vectors of numeric attributes, as described above.

Compare Current Articles' Target Profiles to a User's Search Profiles

The process by which a user employs this apparatus to retrieve newsarticles of interest is illustrated in flow diagram form in FIG. 11. Atstep 1101, the user logs into the data communication network N via theirclient processor C, and activates the news reading program. This isaccomplished by the user establishing a pseudonymous data communicationsconnection as described above to a proxy server S₂, which providesfront-end access to the data communication network N. The proxy serverS₂ maintains a list of authorized pseudonyms and their correspondingpublic keys and provides access and billing control; The user has asearch profile set stored in the local data storage medium on the proxyserver S₂. When the user requests access to “news” at step 1102, theprofile matching module 203 resident on proxy server S₂ sequentiallyconsiders each search profile P_(k) from the user's search profile setto determine which news articles are most likely of interest to theuser. The news articles were automatically clustered into a hierarchicalcluster tree at an earlier step so that the determination can be maderapidly for each user. The hierarchical cluster tree serves as adecision tree for determining which articles' target profiles are mostsimilar to search profile p_(k): the search, for relevant articlesbegins at the top of the tree, and at each level of the tree the branchor branches are selected which have cluster profiles closest to p_(k).This process is recursively executed until the-leaves of the tree arereached, identifying individual articles of interest to the user, asdescribed in the section “Searching for Target Objects” above.

A variation on this process exploits the fact that many users havesimilar interests.

Rather than carry out steps 5-9 of the above process separately for eachsearch profile of each user, it is possible to achieve added efficiencyby carrying out these steps only once for each group of similar searchprofiles, thereby satisfying many users' needs at once. In thisvariation, the system begins by non-hierarchically clustering all thesearch profiles in the search profile sets of a large number of users.For each cluster k of search profiles, with cluster profile p_(k), ituses the method described in the section “Searching for Target Objects”to locate articles with target profiles similar to p_(k). Each locatedarticle is then identified as of interest to each user who has a searchprofile represented in cluster k of search profiles.

Notice that the above variation attempts to match clusters of searchprofiles with similar clusters of articles. Since this is a symmetricalproblem, it may instead be given a symmetrical solution, as thefollowing more general variation shows. At some point before the,matching process commences, all the news articles to be considered areclustered into a hierarchical tree, termed the “target profile clustertree,” and the search profiles of all users to be considered areclustered into a second hierarchical tree, termed the “search profilecluster tree.” The following steps serve to find all matches betweenindividual target profiles from any target profile cluster tree andindividual search profiles from any search profile cluster tree: 1. Foreach child subtree S of the root of the search profile cluster tree (or,let S be the entire search profile cluster tree if it contains only onesearch profile): 2. Compute the cluster profile P_(S) to be the averageof all search profiles in subtree S 3. For each subcluster (childsubtree) T of the root of the target profile cluster tree (or, let T bethe entire target profile cluster tree if it contains only one targetprofile): 4. Compute the cluster profile P_(T) to be the average of alltarget profiles in subtree T 5. Calculate d(P_(S), P_(T), the distancebetween P_(S) and P_(T) 6. If d(P_(S), P_(T))<t, a threshold, 7. If Scontains only one search profile and T contains only one target profile,declare a match between that search profile and that target profile, 8.otherwise recurse to step 1 to find all matches between search profilesin tree S and target profiles in tree T.

The threshold used in step 6 is typically an affine function or otherfunction of the greater of the cluster variances (or cluster diameters)of S and T. Whenever a match is declared between a search profile and atarget profile, the target object that contributed the target profile isidentified as being of interest to the user who contributed the searchprofile. Notice that the process can be applied even when the set ofusers to be considered or the set of target objects to be considered isvery small. In the case of a single user, the process reduces to themethod given for identifying articles of interest to a single user. Inthe case of a single target object, the process constitutes a method foridentifying users to whom that target object is of interest.

Present List of Articles to User

Once the profile correlation step is completed for a selected user orgroup of users, at step 1104 the profile processing module 203 stores alist of the identified articles for presentation to each user. At auser's request, the profile processing system 203 retrieves thegenerated list of relevant articles and presents this list of titles ofthe selected articles to the user, who can then select at step 1105 anyarticle for viewing. (If no titles are available, then the firstsentence(s) of each article can be used.) The list of article titles issorted according to the degree of similarity of the article's targetprofile to the most similar search profile in the user's search profileset. The resulting sorted list is either transmitted in real time to theuser client processor C₁, if the user is present at their clientprocessor C₁, or can be transmitted to amuser's mailbox, resident on theuser's client processor C₁ or stored within the server S₂ for laterretrieval by the user; other methods of transmission include facsimiletransmission of the printed list or telephone transmission by means of atext-to-speech system. The user can then transmit a request by computer,facsimile, or telephone to indicate which of the identified articles theuser wishes to review, if any. The user can still access all articles inany information server S₄ to which the user has authorized access,however, those lower on the generated list are simply further from theuser's interests, as determined by the user's search profile set. Theserver S₂ retrieves the article from the local data storage medium orfrom an information server S₄ and presents the article one screen at atime to the user's client processor C₁. The user can at any time selectanother article for reading or exit the process.

Monitor Which Articles Are Read

The user's search profile set generator 202 at step 1107 monitors whicharticles the user reads, keeping track of how many pages of text areviewed by the user, how much time is spent viewing the article, andwhether all pages of the article were viewed. This information can becombined to measure the depth of the user's interest in the article,yielding a passive relevance feedback score, as described earlier.Although the exact details depend on the length and nature of thearticles being searched, a typical formula might be:

measure of article attractiveness=0.2 if the second page is accessed+0.2if all pages are accessed+0.2 if more than 30 seconds was spent on thearticle+0.2 if more than one minute was spent on the article+0.2 if theminutes spent in the article are greater than half the number of pages.

The computed measure of article attractiveness can then be used as aweighting function to adjust the user's search profile set to therebymore accurately reflect the user's dynamically changing interests.

Update User Profiles

Updating of a user's generated search profile set can be done at step1108 using the method described in copending U.S. patent applicationSer. No. 08/346,425. When an article is read, the server S₂ shifts eachsearch profile in the set slightly in the direction of the targetprofiles of those nearby articles for which the computed measure ofarticle attractiveness was high. Given a search profile with attributesu_(ik) from a user's search profile set, and a set of J articlesavailable with attributes d_(jk) (assumed correct for now), where Iindexes users, j indexes articles, and k indexes attributes, user Iwould be predicted to pick a set of P distinct articles to minimize thesum of d(u_(I), b_(j)) over the chosen articles j. The user's desiredattributes u_(i,k) and an article's attributes d_(jk) would be some formof word frequencies such as TF/IDF and potentially other attributes suchas the source, reading level, and length of the article, while d(u_(I),d_(j)) is the distance between these two attribute vectors (profiles)using the similarity measure described above. If the user picks adifferent set of P articles than was predicted, the user search profileset generation module should try to adjust u and/or d to more accuratelypredict the articles the user selected. In particular, u_(I) and/ord_(j) should be shifted to increase their similarity if user I waspredicted not to select article j but did select it, and perhaps also todecrease their similarity if user I was predicted to select article jbut did not. A preferred method is to shift u for each wrong predictionthat user I will not select article j, using the formula:

u _(ik) ′=u _(ik) −e(u _(ik) d _(jk))

Here u_(I) is chosen to be the search profile from user I's searchprofile set that is closest to target profile. If e is positive, thisadjustment increases the match between user I's search profile set andthe target profiles of the articles user I actually selects, by makingu_(I) closer to d_(j) for the case where the algorithm failed to predictan article that the viewer selected. The size of e determines how manyexample articles one must see to change the search profilesubstantially. If e is too large, the algorithm becomes unstable, butfor sufficiently small e, it drives u to its correct value. In general,e should be proportional to the measure of article attractiveness; forexample, it should be relatively high if user I spends a long timereading article j. One could in theory also use the above formula todecrease the match in the case where the algorithm predicted an articlethat the user did not read, by making e negative in that case. However,there is no guarantee that u will move in the correct direction in thatcase. One can also shift the attribute weights w_(I) of user I by usinga similar algorithm:

w _(ik)′=(w _(ik) −e|u _(ik) −d _(jk)|)/S_(k)(w _(ik) −e|u _(ik) −d_(jk)|)

This is particularly important if one is combining word frequencies withother attributes. As before, this increases the match if e ispositive—for the case where the algorithm failed to predict an articlethat the user read,this time by decreasing the weights on thosecharacteristics for which the user's target profile u_(I) differs fromthe article's profile d_(j). Again, the size of e determines how manyexample articles one must see to replace, what was originally believed.Unlike the procedure for adjusting u, one also make use of the fact thatthe above algorithm decreases the match if e is negative—for the casewhere the algorithm predicted an article that the user did not read. Thedenominator of the expression prevents weights from shrinking to zeroover time by renormalizing the modified weights w_(I)′ so that they sumto one. Both u and w can be adjusted for each article accessed. When eis small, as it should be, there is no conflict between the two parts ofthe algorithm. The selected user's search profile set is updated at step1108.

Further Applications of the Filtering Technology

The news clipping service may deliver news articles (or advertisementsand coupons for purchasables) to off-line users as well as to users whoare on-line. Although the off-line users may have no way of providingrelevance feedback, the user profile of an off-line user U may besimilar to the profiles of on-line users, for example because user U isdemographically similar to these other users, and the level of user U'sinterest in particular target objects can therefore be estimated via thegeneral interest-estimation methods described earlier. In oneapplication, the news clipping service chooses a set of news articles(respectively, advertisements and coupons) that are predicted to be ofinterest to user U, thereby determining the content of a customizednewspaper (respectively, advertising/coupon circular) that may beprinted and physically sent to user U via other methods. In general, thetarget objects included in the printed document delivered to user U arethose with the highest median predicted interest among a group G ofusers, where group G consists of either the single off-line user U, aset of off-line users who are demographically similar to user U, or aset of off-line users who are in the same geographic area and thus onthe same newspaper delivery route. In a variation, user group G isclustered into several subgroups G1 . . . Gk; an average user profile Piis created from each subgroup Gi; for each article T and each userprofile Pi, the interest in T by a hypothetical user with user profilePi is predicted, and the interest of article T to group G is taken to bethe maximum interest in article T by any of these k, hypothetical users;finally, the customized newspaper for user group G is constructed fromthose articles of greatest interest to group G.

The filtering technology of the news clipping service is not limited tonews articles provided by a single source, but may be extended toarticles or target objects collected from any number of sources. Forexample, rather than identifying new news articles of interest, thetechnology may identify new or updated World Wide Web pages of interest.In a second application, termed “broadcast clipping,” where individualusers desire to broadcast messages to all interested users, the pool ofnews articles is replaced by a pool of messages to be broadcast, andthese messages are sent to the broadcast-clipping-service subscribersmost interested in them. In a third application, the system scans thetranscripts of all real-time spoken or written discussions on thenetwork that are currently in progress and designated as public, andemploys the news-clipping technology to rapidly identify discussionsthat the user may be interested in joining, or to rapidly identify andnotify users who may be interested in joining an ongoing discussion. Ina fourth application, the method is used as a post-process that filtersand ranks in order of interest the many target objects found by aconventional database search, such as a search for all homes selling forunder $200,000 in a given area, for all 1994 news articles about MarciaClark, or for all Italian-language films. In a fifth application, themethod is used to filter and rank the links in a hypertext document byestimating the user's interest in the document or other objectassociated with each link. In a sixth application, paying advertisers,who may be companies or individuals, are the, source of advertisementsor other messages, which take the place of the news articles in the newsclipping service. A consumer who buys a product is deemed to haveprovided positive relevance feedback on advertisements for that product,and a consumer who buys a product apparently because of a particularadvertisement (for example, by using a coupon clipped from thatadvertisement) is deemed to have provided particularly high relevancefeedback on that advertisement. Such feedback may be communicated to aproxy server by the consumer's client processor (if the consumer ismaking the purchase electronically), by the retail vendor, or by thecredit-card reader (at the vendor's establishment) that the consumeruses to pay for the purchase. Given a database of such relevancefeedback, the disclosed technology is then used to match advertisementswith those users who are most interested in them; advertisementsselected for a user are presented to that user by any one of severalmeans, including electronic mail, automatic display on the users screen,or printing them on a printer at a retail establishment where theconsumer is paying for a purchase. The threshold distance used toidentify interest may be increased for a particular advertisement,:causing the system to present that advertisement to more users, inaccordance with the amount that the advertiser is willing to pay.

A further use of the capabilities of this system is to manage a user'sinvestment portfolio. Instead of recommending articles to the user, thesystem recommends target objects that are investments. As illustratedabove by the example of stock market investments, many differentattributes can be used together to profile each investment. The user'spast investment behavior is characterized in the user's search profileset or target profile interest summary, and this information is used tomatch the user with stock opportunities (target objects) similar innature to past investments. Th e rapid profiling method described abovemay be used to determine a rough set of preferences for new users.Quality attributes used in this system can include negatively weightedattributes, such as a measurement of fluctuations in dividendshistorically paid by the investment, a quality attribute that would havea strongly negative weight for a conservative investor dependent on aregular flow of investment income. Furthermore, the user can set filterparameters so that the system can monitor stock prices and automaticallytake certain actions, such as placing buy or sell orders, or e-mailingor paging the user with a notification, when certain stock performancecharacteristics are met. Thus, the system can immediately notify theuser when a selected stock reaches a predetermined price, without theuser having to monitor the stock market activity. The user's investmentscan be profiled in part by a “type of investment” attribute (to be usedin conjunction with other attributes), which distinguishes among bonds,mutual funds, growth stocks, income stocks, etc., to thereby segment theuser's portfolio according to investment type. Each investment type canthen be managed to identify investment opportunities and the user canidentify the desired ratio of investment capital for each type, e.g., inaccordance with the system's automatic recommendation for relativedistribution of investment capital as indicated by the relative level ofuser interest for each type.

In one application, the system may also keep track of and recommend,notify (or page for new releases and new articles) of important articleswhich are most interesting to other users who have a similar stockportfolio to that of the user. Relevance feedback in this applicationdetermines the relevance of the associative attributes (each stock) withthe relevant textual attribute contained in the free text of thearticle's Other descriptors plus any relevant numeric attributescontained in the articles. Additionally, one could bias the weightingvalues of users providing relevance feedback to favor those who haveinvested in similar types of stocks and who have a proven track recordof success through their trading decisions. Another application forwhich this preadjusted relevance feedback is useful is in recommendingand/or automatically trading the most interesting stocks to users usingthe collaborative filtering methods above described. However, biasingthe relevance feedback to the system by those users who had been mostsuccessful in their trading decisions in the past with regards tosimilar types of stocks. Accordingly, in accordance with the similaritytechniques-of articles and stocks which are most relevant to oneanother.

Because there are numerous methods which are used to attempt to predictfor users both stocks and optimal times to buy or trade, the currentuser customization techniques are best implemented as an enhancementfeature to not only provide the user with quality but alsocustomization.

In the preferred implementation for an on-line newspaper or news filter,each of these capabilities for customized recommendation notification ofinvested related articles, stock recommendations and automatedmonitoring and trading features are provided to the user as anintegrated financial news and investment service. Additionally, inaccordance with the virtual communities section below described, userssharing common portfolios may wish to correspond on-line to share adviceor experiences with other similar users. Again, users would have a pasttrack record of success may also be identifiable through these virtualcommunities in conjunction with their participation in these communitiesor their comments and advice relating to specific stocks may be ascribedto those stocks (and made publicly available).

OTHER ON-LINE NEWSPAPER INTERFACE FEATURES

In accordance with current on-line news interface features, severalimplementation features of the present system include the following:

1. Automatically create a “customized newspaper”.

User profiling enabling custom recommendations may be achieved by purelypassive means of user activity data or if desired, it can refine andautomate the selection process of articles within user selectedcategories of interest as well as recommend articles within differentcategories which the user is likely to prefer as evidenced through pastbehaviors. Applications include:

(a) Presentation of new articles and corresponding advertisements whichare of highest interest to the user.

(b) Recommending (highlighting) these articles from the directory.

2. A customized search engine which offers search results which aretailored and relevancy ranked to user preferences.

3. Using a survey for off-line users for subsequent issues, an insertedcard inserted into each issue identifies or prioritizes the mostinteresting articles/ads.

E-Mail Filter

In addition to the news clipping service described above, the system forcustomized electronic identification of desirable objects functions inan e-mail environment in a similar but slightly different manner. Thenews clipping service selects and retrieves news information that wouldnot otherwise reach its subscribers. But at the same time, large numbersof e-mail messages do reach users, having been generated and sent byhumans or automatic programs. These users need an e-mail filter, whichautomatically processes the messages received. The necessary processingincludes a determination of the action to be taken with each message,including, but not limited to: filing the message, notifying the user ofreceipt of a high priority message, automatically responding to amessage. The e-mail filter system must not require too great aninvestment on the part of the user to learn and use, and the user musthave confidence in the appropriateness of the actions automaticallytaken by the system. The same filter may be applied to voice mailmessages or facsimile messages that have been converted intoelectronically stored text, whether automatically or at the user'srequest, via the use of w ell-known techniques for speech recognition oroptical character recognition.

The filtering problem can be defined as follows: a message processingfunction MPF(*) maps from a received message (document) to one or moreof a set of actions. The actions, which may be quite specific, may beeither predefined or customized by the use r. Each action A has anappropriateness function F_(A) (*,*) such that F_(A) (U,D) returns areal number, representing the appropriateness of selecting action A onbehalf of user U when user U is in receipt of message D. For example, ifD comes from a credible source and is marked urgent, then discarding themessage has a high cost to the user and has low appropriateness, so thatF_(discard) (U,D) is small, whereas alerting the user of receipt of themessage is highly appropriate, so that F_(alert) (U,D) is large. Giventhe determined appropriateness function, the function MPF(D) is used toautomatically select the appropriate, action or actions. As an example,the following set of actions might be useful:

1. Urgently notify user of receipt of message

2. Insert message into queue for user to read later

3. Insert message into queue for user to read later, and suggest thatuser reply

4. Insert message into queue for user to read later, and suggest thatuser forward it to individual R

5. Summarize message and insert summary into queue

6. Forward message to user's secretary

7. File message in directory X

8. File message in directory Y

9. Delete message (i.e., ignore message and do not save)

10. Notify sender that further messages on this subject are unwanted

Notice that actions 8 and 9 in the sample list above are designed tofilter out messages that are undesirable to the user or that arereceived from undesirable sources, such as pesky salespersons, bydeleting the unwanted message and/or sending a reply that indicates thatmessages of this type will not be read. The appropriateness functionsmust be tailored to describe the appropriateness of carrying out eachaction given the target profile for a particular document, and then amessage processing function MPF can be found which is in some senseoptimal with respect to the appropriateness function. One reasonablechoice of MPF always picks the action with highest appropriateness, an din. cases where multiple actions are highly appropriate and are alsocompatible with each other, selects more than one action: for example,it may automatically reply to a message and also file the same messagein directory X, so that the value of MPF(D)) is the set {reply, file indirectory X

}. In cases where the appropriateness of even the most appropriateaction falls below a user-specified threshold, as should happen formessages of an unfamiliar type, the system asks the user forconfirmation of the action(s) selected by MPF. In addition, in caseswhere MPF selects one action over another action that is nearly asappropriate, the system also asks the user for confirmation: forexample, mail should not be deleted if it is nearly as appropriate tolet the user see it.

It is possible to write appropriateness fuinctions manually, but thetime necessary and lack of user expertise render this solutionimpractical. The automatic training of this system-is preferable, usingthe automatic user profiling system described above. Each receiveddocument is viewed as a target object whose profile includes suchattributes as the entire text of the document (represented as TF/TDFscores), document sender, date sent, document length, date of lastdocument received from this sender, key words, list of other addressees,etc. It was disclosed above how to estimate an interest function onprofiled target objects, using relevance feedback together with measuredsimilarities among target objects and among users. In the con text ofthe e-mail filter, the task is to estimate, several appropriatenessfuinctions F_(A) (*,*), one per action. This is handled with exactly thesame method as was used earlier to estimate the topical interestfunction f(*,*) Relevance feedback in this case is provided by the users observed actions over time: whenever user U chooses action A ondocument D, either freely or by choosing or confirming an actionrecommended by the system, this is taken to mean that theappropriateness of action A on document D is high, particularly if theuser takes this action A immediately after seeing document D. Apresumption of no appropriateness (corresponding to the earlierpresumption-of no interest) is used so that action A is consideredinappropriate on a document unless the user or similar users have takenaction A on this document or similar documents. In particular, if nosimilar document has been seen, no action is considered especiallyappropriate, and the e-mail filter asks the user to specify theappropriate action or confirm that the action chosen by the e-mailfilter is the appropriate one.

Thus, the e-mail filter learns to take particular actions on e-mailmessages that have certain attributes or combinations of attributes. Forexample, messages from John Doe that originate in the, (212) area codemay prompt the system to forward a copy by fax transmission to a givenfax number, or to file the message in directory X on the user's clientprocessor. A variation allows active requests of this form from theuser, such as a request that any message from. John Doe be forwarded toa desired fax number until further notice. This active user inputrequires the use of a natural language or form-based interface for whichspecific commands are associated with particular attributes andcombinations of attributes.

Update Notification

A very important and novel characteristic of the architecture is theability to identify new or updated target objects that are relevant tothe user, as determined by the user's search profile set or targetprofile interest summary. (“Updated target objects” include revisedversions of documents and new models of purchasable goods.) The systemmay notify the user of these relevant target objects by an electronicnotification such as an e-mail message or facsimile transmission. In thevariation where the system sends an e-mail message, the user's e-mailfilter can then respond appropriately to the notification, for instance,by bringing the notification immediately to the user's personalattention, or by automatically submitting an electronic request topurchase the target object named in the notification. A simple exampleof the latter response is for the e-mail filter to retrieve an on-linedocument at, a nominal or zero charge, or request to buy a purchasableof limited quantity such as a used product or an auctionable.

ACTIVE NAVIGATION (BROWSING)

Browsing by Navigating Through a Cluster Tree

A hierarchical cluster tree imposes a useful organization on acollection of target objects. The tree is of direct use to a user whowishes to browse through all the target objects in the tree. Such a usermay be exploring the collection with or without a well-specified goal.The tree's division of target objects into coherent clusters provides anefficient method whereby the user can locate a target object ofinterest. The user first chooses one of the highest level (largest)clusters from a menu, and is presented with a menu listing thesubdlusters of said cluster, whereupon the user may select one of thesesubdlusters. The system locates the subdluster, via the appropriatepointer that was stored with the larger cluster, and allows the user toselect one of its subclusters from another menu. This process isrepeated until the user comes to a leaf of the tree, which yields thedetails of an actual target object. Hierarchical trees allow rapidselection of one target object from a large set. In ten menu selectionsfrom menus of ten items (subclusters) each, one can reach10¹⁰=10,000,000,000 (ten billion) items. In the preferred embodiment,the user views the menus on a computer screen or terminal screen andselects from them with a keyboard or mouse. However, the user may alsomake selections over the telephone, with a voice synthesizer reading themenus and the user selecting subclusters via the telephone's touch-tonekeypad. In another variation, the user simultaneously maintains twoconnections to the server, a telephone voice connection and a faxconnection; the server sends successive menus to the user by fax, whilethe user selects choices via the telephone's touch-tone keypad.

Just as user profiles commonly include an associative attributeindicating the user's degree of interest in each target object, it isuseful to augment user profiles with an additional associative attributeindicating the user's degree of interest in each cluster in thehierarchical cluster tree. This degree of interest may be estimatednumerically as the number of subclusters or target objects the user hasselected from menus associated with the given cluster or itssubclusters, expressed as a proportion of the total number ofsubclusters or target objects the user has selected. This associativeattribute is particularly valuable if the hierarchical tree was builtusing “soft” or “fuzzy” clustering, which allows a subcluster or targetobject to appear in multiple clusters: if a target document appears inboth the “sports” and the “.humor” clusters, and the user selects itfrom a menu associated with the “humor” cluster, then the systemincreases its association between the user and the “humor” cluster butnot its association between the user and the “sports” cluster.

Labeling Clusters

Since a user who is navigating the cluster tree is repeatedly expectedto select one of several subclusters from a menu, these subclusters mustbe usefully labeled (at step 503), in such a way as to suggest theircontent to the human user. It is straightforward to include some basicinformation about each subcluster in its label, such as the number oftarget objects the subdluster contains (possibly just 1) and the numberof these that have been added or updated recently. However, it, is alsonecessary to display additional information that indicates the cluster'scontent. This content-descriptive information may be provided by ahuman, particularly for large or frequently accessed clusters, but itmay also be generated automatically. The basic automatic technique issimply to display the cluster's “characteristic value” for each of a fewhighly weighted attributes. With numeric attributes, this may be takento mean the cluster's average value for that attribute: thus, if the“year of release”attribute is highly weighted in predicting which moviesa user will like, then it is useful to display average year of releaseas part of each cluster's label. Thus the user sees that one clusterconsists of movies that were released around 1962, while anotherconsists of movies from around 1982. For short textual attributes, suchas “title of movie” or “title of document,” the system can display theattribute's value for the cluster member (target object) whose profileis most similar to the cluster's profile (the mean profile for allmembers of the cluster), for example, the title of the most typicalmovie in the cluster. For longer textual attributes, a useful techniqueis to select those terms for which the amount by which the term'saverage TF/IDF score across members of the cluster exceeds the term'saverage TF/IDF score across all tar get objects is greatest, either inabsolute terms or else as a fraction of the standard deviation of theterm's TF/IDF score across all target objects. The selected terms arereplaced with their morphological stems, eliminating duplicates (so thatif both “slept” and “sleeping” were selected, they would be replaced bythe single term “sleep”) and optionally eliminating close synonyms orcollocates (so that if both “nurse” and “medical” were selected, theymight both be replaced by a single term such as, “nurse,” “medical,”“medicine,” or “hospital”). The resulting set of terms is displayed aspart of the label. Finally, if freely redistributable thumbnailphotographs or other graphical images are associated with some of thetarget objects in the cluster f or labeling purposes, then the systemcan display as part of the label the image or images whose associatedtarget objects have target profiles most similar to the cluster profile.

Users' navigational patterns may provide some useful feedback as to thequality of the labels. In particular, if users often select a particularcluster to explore, but then quickly backtrack and try a differentcluster, this may signal that the first cluster's label is misleading.Insofar as other terms and attributes can pro video “next-best”alternative labels for the first cluster, such “next-best” labels can beautomatically substituted for the misleading label. In addition, anyuser can locally relabel a cluster for his or her own convenience.Although a cluster label provided by a user is in general visible onlyto that user, it is possible to make global use of these labels via a“user labels” textual attribute for target objects, which attribute isdefined for a given target object to be the concatenation of all label sprovided by any user for any cluster containing that target object. Thisattribute influences similarity judgments: for example, it may inducethe system to regard target articles in a cluster often labeled “SportsNews” by users as being mildly similar to articles in an otherwisedissimilar cluster often labeled “International News” by users,precisely because the “user labels” attribute in each cluster profile isstrongly associated with the term “News.” The “user label” attribute isalso used in the automatic generation of labels, just as other textualattributes are, so that if the user-generated labels for a cluster ofteninclude “Sports,” the term “Sports” may be included in the automaticallygenerated label as well.

It is not necessary for menus to be displayed as simple lists of labeledoptions; it is possible to display or print a menu in a form that showsin more detail the relation of the different menu options to each other.Thus, in a variation, the menu options are visually laid out in twodimensions or in a perspective drawing of three dimensions. Each optionis displayed or printed as a textual or graphical label. The physicalcoordinates at which the options are displayed or printed are generatedby the following sequence of steps: (1) construct for each option thecluster profile of the cluster it represents, (2) construct from eachcluster profile its decomposition into a numeric vector, as describedabove, (3) apply singular, value decomposition (SVD) to determine theset of two or three orthogonal linear axes along which these numericvectors are most greatly differentiated, and (4) take the coordinates ofeach option to be the projected coordinates of that option's numericvector along said axes. Step (3) may be varied to determine a set of,say, 6 axes, so that step (4) lays out the options in a 6-dimensionalspace; in this case the user may view the geometric projection of the6-dimensional layout onto any plane passing through the origin, and mayrotate this viewing plane in order to see differing configurations ofthe options, which emphasize similarity with respect to differingattributes in the profiles of the associated clusters. In the visualrepresentation, the sizes of the cluster labels can be varied accordingto the number of objects contained in the corresponding clusters. In afurther variation, all options from the parent menu are displayed insome number of dimensions, as just described, but with the optioncorresponding to the current menu replaced by a more prominentsubdisplay of the options on the current menu; optionally, the scale ofthis composite display may be gradually increased over time, therebyincreasing the area of the screen devoted to showing the options on thecurrent menu, and giving the visual impression that the user isregarding the parent cluster and “zooming in” on the current cluster andits subclusters.

Further Navigational

It should be appreciated that a hierarchical cluster-tree may beconfigured with multiple cluster selections branching from each node orthe same labeled clusters presented in the form of single branches formultiple nodes ordered in a hierarchy. In one variation, the user isable to perform lateral navigation between neighboring clusters as well,by requesting that the system search for a cluster whose cluster profileresembles the cluster profile of the currently selected cluster. If thistype of navigation is performed at the level of individual objects (leafends), then automatic hyperlinks may be then created as navigationoccurs. This is one way that nearest-neighbor clustering navigation maybe performed. For example, in a domain where target objects are homepages on the World Wide Web, a collection of such pages could belaterally linked to create a “virtual mall.”

The simplest way to use the automatic menuing system described above isfor the user to begin browsing at the top of the tree and moving to morespecific subclusters. However, in a variation, the user optionallyprovides a query consisting of textual and/or other attributes, fromwhich query the system constructs a profile in the manner describedherein; optionally altering textual attributes as described hereinbefore decomposing them into numenc attributes. Query profiles aresimilar to the search profiles in a user's search profile set, exceptthat their attributes are explicitly specified by a user, most often forone-time usage, and unlike search profiles, they are not automaticallyupdated to reflect changing interests. A typical query in the domain oftext articles might have “Tell me about the relation between Galileo andthe Medici family” as the value of its “text of article” attribute, and8 as the value of its “reading difficulty” attribute (that is, 8th-gradelevel). The system uses the method of section “Searching for TargetObjects” above to automatically locate a small set of one or moreclusters with profiles similar to the query profile, for example, thearticles they contain are written at roughly an 8th-grade level and tendto mention Galileo and the Medicis. The user may start browsing at anyof these clusters, and can move from it to subclusters, superclusters,and other nearby clusters. For a user who is looking for something inparticular, it is generally less efficient to start at the largestcluster and repeatedly select smaller subclusters than it is to write abrief description of what one is looking for and then to move to nearbyclusters if the objects initially recommended are not precisely thosedesired.

Although it is customary in information retrieval systems to match aquery to a document, an interesting variation is possible where a queryis- matched to an already. answered question. The relevant domain is acustomer service center, electronic newsgroup, or Better Business Bureauwhere questions are frequently answered. Each new question-answer pairis recorded for future: reference as a target object, with a textualattribute that specifies the question together with the answer provided.As explained earlier with reference to document titles, the questionshould be weighted more heavily than the answer when this textualattribute is decomposed into TF/IDF scores. A query specifying “Tell meabout the relation between Galileo and the Medici family” as the valueof this attribute therefore locates a cluster of similar questionstogether with their answers. In a variation, each question-answer pairmay be profiled with two separate textual attributes, one for thequestion and one for the answer. A query might then locate a cluster byspecifying only the question attribute, or for completeness, both thequestion attribute and the (lower-weighted) answer attribute, to be thetext “Tell me about the relation between Galileo and the Medici family.”

The filtering technology described earlier can also aid the user innavigating among the target objects. When the system presents the userwith a menu of subclusters of a cluster C of target objects, it cansimultaneously present an additional menu of the most interesting targetobjects in cluster C, so that the user has the choice of accessing asubcluster or directly accessing one of the target objects. If thisadditional menu lists n target objects, then for each I between 1 and ninclusive, in increasing order, the I^(th) most prominent choice on thisadditional menu, which choice is denoted Top(C,i), is found byconsidering all target objects in cluster C that are further than athreshold distance t from all of Top(C,1), Top(C,2), . . . Top(C, I-1),and selecting the one in which the user's interest is estimated to behighest. If the threshold distance t is 0, then the menu resulting fromthis procedure simply displays the n most interesting objects in clusterC, but the threshold distance may be increased to achieve more varietyin the target objects displayed. Generally the threshold distance t ischosen to be an affine function or other function of the clustervariance or cluster diameter of the cluster C.

As a novelty feature, the user U can “masquerade” as another user V,such as a prominent intellectual or a celebrity supermodel; as long asuser U is masquerading as user V, the filtering technology willrecommend articles not according to user U's preferences, but ratheraccording to user V's preferences. Provided that user U has access tothe user-specific data of user V, for example because user V has leasedthese data to user U for a financial consideration, then user U canmasquerade as user V by instructing user U's proxy server S totemporarily substitute user, V's user profile and target profileinterest summary for user U's. In a variation, user U has access to anaverage user profile and an composite target profile interest summaryfor a group G of users; by instructing proxy server S to substitutethese for user Us user-specific data, user U can masquerade as a typicalmember of group G, as is useful in exploring group preferences forsociological, political, or market research. More generally, user U may“partially masquerade” as another user V or group G, by instructingproxy server S to temporarily replace user U's user-specific data with aweighted average of user U's user-specific data and the user-specificdata for user V and group G.

Menu Organization

Although the topology of a hierarchical cluster tree is fixed by thetechniques that build the tree, the hierarchical menu presented to theuser for the user's navigation need not be exactly isomorphic to thecluster tree. The menu is typically a somewhat modified version of thecluster tree, reorganized manually or automatically so that the clustersmost interesting to a user are easily accessible by the user. In orderto automatically reorganize the menu in a user-specific way, the systemfirst attempts automatically to identify existing clusters that are ofinterest to the user. The system may identify a cluster as interestingbecause the user often accesses target objects in that cluster—or, in amore sophisticated variation, because the user is predicted to have highinterest in the cluster's profile, using the methods disclosed hereinfor estimating interest from relevance feedback.

Several techniques can then be used to make interesting clusters moreeasily accessible. The system can at the user's request or at all timesdisplay a special list of the most interesting clusters, or the mostinteresting subclusters of the current cluster, so that the user canselect one of these clusters based on its label and jump directly to it.In general, when the system constructs a list of interesting clusters inthis way, the I^(th) most prominent choice on the list, which choice isdenoted Top(I), is found by considering all appropriate clusters C thatare further than a threshold distance t from all of Top(1), Top(2), . .. Top(I-1), and selecting the one in which the user's interest isestimated to be highest. Here the threshold distance t is optionallydependent on the computed cluster variance or cluster diameter of theprofiles in the latter cluster. Several techniques that reorganize thehierarchical menu tree are also useful. First menus can be reorganizedso that the most interesting subcluster choices appear earliest on themenu, or are visually marked as interesting, for example, their labelsare displayed in a special color or type face, or are displayed togetherwith a number or graphical image indicating the likely level ofinterest. Second, interesting clusters can be moved to menus higher inthe tree, i.e., closer to the root of the tree, so that they are easierto access if the user starts browsing at the root of the tree. Third,uninteresting clusters can be moved to menus lower in the tree, to makeroom for interesting clusters that are being moved higher. Fourth,clusters with an especially low interest score (representing activedislike) can simply be suppressed from the menus; thus, a user withchildren may assign an extremely negative weight to the “vulgarity”attribute in the determination of q, so that vulgar clusters anddocuments will not be available at all. As the interesting clusters andthe documents in them migrate. toward the top of the tree, a customizedtree develops that can be more efficiently navigated by the particularuser. If menus are chosen so that each menu item is chosen withapproximately equal probability, then the expected number of choices theuser has to make is minimized. If, for example, a user frequentlyaccessed target objects whose profiles resembled the cluster profile ofcluster (a, b, d) in FIG. 8 then the menu in FIG. 9 could be modified toshow the structure illustrated in FIG. 10.

In the variation where the general techniques disclosed herein forestimating a user's interest from relevance feedback are used toidentify interesting clusters, it is possible for a user U to supply“temporary relevance feedback” to indicate a temporary interest that isadded to his or her usual interests. This is done by entering a query asdescribed above, i.e., a set of textual and other attributes thatclosely match the user's interests of the moment This query becomes“active,” and affects the system's determination of interest in eitherof two ways. In one approach, an active query is treated as if it wereany other target object, and by virtue of being a query, it is taken tohave received relevance feedback that indicates especially highinterest. In an alternative approach, target objects X whose targetprofiles are similar to an active query's profile are simply consideredto have higher quality q(U, X), in that q(U, X) is incremented by a termthat increases with target object X's similarity to the query profile.Either strategy affects the usual interest estimates: clusters thatmatch user U's usual interests (and have high quality q(*)) are stillconsidered to be of interest, and clusters w hose profiles are similarto an active query are adjudged to have especially high interest.Clusters that are similar to both the query and the user's usualinterests are most interesting of all. The user may modify or deactivatean active query at any time while browsing. In addition, if the userdiscovers a target object or cluster X of particular interest whilebrowsing, he or she may replace or augment the original (perhaps vague)query profile with the target profile of target object or cluster X, thereby amplifying or refining the original query to indicate anparticular interest in objects similar to X. For example, suppose theuser is browsing through documents, and specifies an initial querycontaining the word “Lloyd's,” so that the system predicts documentscontaining the word “Lloyd's” to be more interesting and makes them moreeasily accessible, even to the point of listing such documents orclusters of such documents, as described above. In particular, certainarticles about insurance containing the phrase “Lloyd's of London” aremade more easily accessible, as are certain pieces of Welsh fictioncontaining phrases like “Lloyd's father.” The user browses while thisquery is active, and hits upon a useful article describing the relationof Lloyd's of London to other British insurance houses; by replacing oraugmenting the query with the full text of this article, the user canturn the attention of the system to other documents that resemble thisarticle, such as documents about British insurance houses, rather thanWelsh folk tales.

In a system where queries are used, it is usefull to include in thetarget profiles an associative attribute that records the associationsbetween a target object and whatever terms are employed in queries usedto find that target object. The association score of target object Xwith a particular query term T is defined to be the mean relevancefeedback on target object X, averaged over just those accesses of targetobject X that. were made while a query containing term T was active,multiplied by the negated logarithm of term T's global frequency in allqueries. The effect of this associative attribute is to increase themeasured similarity of two documents if they are good responses toqueries that contain the same terms. A further maneuver can be used toimprove the accuracy of responses to a query: in the summation used todetermine the quality q(U, X) of a target object X, a term is includedthat is proportional to the sum of association scores between targetobject X and each term in the active query, if any, so that targetobjects that are closely associated with terms in an active query aredetermined to have higher quality and therefore higher interest for theuser. To complement the system's automatic reorganization of thehierarchical cluster tree, the user can be given the ability toreorganize the tree manually, as he or she sees fit. Any changes areoptionally saved on the user's local storage device so that they willaffect the presentation of the tree in future sessions. For example, theuser can choose to move or copy menu options to other menus, so thatusefull clusters can thereafter be chosen directly from the root menu ofthe tree or from other easily accessed or topically appropriate menus.In an other example, the user can select clusters C₁, C₂, . . . C_(k)listed on a particular menu M and choose to remove these, clusters fromthe menu, replacing them on the menu with a single aggregate cluster Mcontaining all the target objects from clusters C₁, C₂, . . . C_(k). Inthis case, the immediate subclusters of new cluster M are either takento be clusters C₁, C₂, . . . C_(k) themselves, or else, in a variationsimilar to the “scatter-gather” method, are automatically computed byclustering the set of all the subclusters of clusters C₁, C₂, . . .C_(k) according to the similarity of the cluster profiles of thesesubclusters.

Electronic Mall

In one application, the browsing techniques described above may beapplied to a domain where the target objects are purchasable goods. Whenshoppers look for goods to purchase over the Internet or otherelectronic media, it is typically necessary to display thousands or tensof thousands of products in a fashion.,that helps consumers find theitems they are looking for. The current practice is to use hand-craftedmenus and sub-menus in which similar items are grouped together. It ispossible to use the automated clustering and browsing methods describedabove to more effectively group and present the items. Purchasable itemscan be hierarchically clustered using a plurality of different criteria.Useful attributes for a purchasable item include but are not limited toa textual description and predefined category labels (if available), theunit price of the item, and an associative attribute listing the userswho have bought this item in the past. Also useful is an associativeattribute indicating which other items are often bought on the sameshopping “trip” as this item; items that are often bought on the sametrip will be judged similar with respect to this attribute, so tend tobe grouped together. Retailers may be interested in utilizing a similartechnique for purposes of predicting both the nature and relativequantity of items which are likely to be popular to their particularclientele. This prediction may be made by using aggregate purchasingrecords as the search profile set from which a collection of targetobjects is recommended. Estimated customer demand which is indicative of(relative) inventory quantity for each target object item is determinedby measuring the cluster variance of that item compared to anothertarget object item (which is in stock).

As described above, hierarchically clustering the-purchasable targetobjects results in a hierarchical menu system, in which the targetobjects or clusters of target objects-that appear on each menu can belabeled by names or icons and displayed in a two-dimensional orthree-dimensional menu in which similar items are displayed physicallynear each other or on the same graphically represented “shelf.” Asdescribed above, this grouping occurs both at the level of specificitems (such as standard size Ivory soap or large Breck shampoo) and atthe level of classes of items (such as soaps and shampoos). When theuser selects a class of items (for: instance, by clicking on it), thenthe more specific level of detail is displayed. It is neither necessarynor desirable to limit each item to appearing in one group; customersare more likely to find an object if it is in multiple categories.Non-purchasable objects such as artwork, advertisements, and freesamples may also be added to a display of purchasable objects, if theyare associated with (liked by) substantially the same users as are thepurchasable objects in the display.

Network Context of the Browsing System

The files associated with target objects are typically distributedacross a large number of different servers S1-So and clients C1-Cn. Eachfile has been entered into the data storage medium at some server orclient in any one of a number of ways, including, but not limited to:scanning, keyboard input, e-mail, FTP transmission automatic synthesisfrom another file under the control of another computer program. While asystem to enable users to efficiently locate target objects may storeits hierarchical cluster tree on a single centralized machine, greaterefficiency can be achieved if the storage of the hierarchical clustertree is distributed across many machines in the network. Each cluster C,including single-member clusters (target objects), is digitallyrepresented by a file F, which is multicast to a topical multicast treeMT(C1); here cluster C1 is either cluster C itself or some superclusterof cluster C. In this way, file F is stored at multiple servers, forredundancy. The file F that represents cluster C contains at least thefollowing data:

1. The cluster profile for cluster C, or data sufficient to reconstructthis cluster profile. 2. The number of target objects contained incluster C. 3. A human-readable label for cluster C, as described insection. “Labeling Clusters”above. 4. If the cluster is divided intosubclusters, a list of pointers to files representing the subclusters.Each pointer is an ordered pair containing naming, first, a file, andsecond, a multicast tree or a specific server where that file is stored.5. If the cluster consists of a single target object, a pointer to thefile corresponding to that target object.

The process by which a client machine can retrieve the file F from themulticast tree MT(C1) is described above in section “Retrieving Filesfrom a Multicast Tree.” Once it has retrieved file F the client canperform further tasks pertaining to this cluster, such as displaying alabeled menu of subclusters, from which the user may select subclustersfor the client to retrieve next.

The advantage of this distributed implementation is threefold. First,the system can be scaled to larger cluster sizes and numbers of targetobjects, since much more searching and data retrieval can be carried outconcurrently. Second, the system is fault-tolerant in that partialmatching can be achieved even if portions of the system are temporarilyunavailable. It is important to note here the robustness due toredundancy inherent in our design data is replicated at tree sites sothat even if a server is down, the data can be located elsewhere.

The distributed hierarchical cluster tree can be created in adistributed fashion, that is, with the participation of many processors.Indeed, in most applications it should be recreated from time to time,because as users interact with target objects, the associativeattributes in the target profiles of the target objects change toreflect these interactions; the system's similarity measurements cantherefore take these interactions into account when judging similarity,which allows a more perspicuous cluster tree to be built. The keytechnique is the following procedure for merging n disjoint clustertrees, represented respectively: by files F1 . . . Fn in distributedfashion as described above, into a combined cluster tree that containsall the target objects from all these trees. The files F1 . . . Fn aredescribed above, except that the cluster labels are not included in therepresentation. The following steps are executed by a server S1, inresponse to a request message from another server S0, which requestmessage includes pointers to the files F1 . . . Fn. 1. Retrieve files F1. . . Fn. 2. Let Land M be empty lists. 3. For each file Fi from amongF1 . . . Fn: 4. If file Fi contains pointers to subdluster files, addthese pointers to: list L. 5. If file Fi represents a single-targetobject, add a pointer to file Fi to list L. 6. For each pointer X onlist L, retrieve the-file that pointer P points to and extract thecluster profile P(X) that this file stores. 7. Apply a clusteringalgorithm to group the pointers X on list L according to the distancesbetween their respective cluster profiles P(X). 8. For each (nonempty)resulting group C of pointers: 9. If C contains only one pointer, addthis pointer to list M; 10. otherwise, if C contains exactly the samesubcluster pointers as does one of the files Fi from among F1 . . . Fn,then add a pointer to file Fi to list M; 11. otherwise: 12. Select anarbitrary server S2 on the network, for example by randomly selectingone of the pointers in group C and choosing the server it points to. 13.Send a request message to server S2 that includes the subclusterpointers in group C and requests server S2 to merge the correspondingsubcluster trees. 14. Receive a response from server S2, containing apointer to a file G that represents the merged tree. Add this pointer tolist M. 15. For each file Fi from among F1 . . . Fn: 16. If list M doesnot include a pointer to file F1, send a message to the server orservers storing Fi instructing them to delete file Fi. 17. Create andstore a file F that represents a new cluster, whose subdluster pointersare exactly the subcluster pointers on list M. 18. Send a reply messageto server S0, which reply message contains a pointer to file F andindicates that file F represents the merged cluster tree.

With the help of the above procedure, and the multicast tree MT fullthat includes all proxy servers in the network, the distributedhierarchical cluster tree for a particular domain of target objects isconstructed by merging many local hierarchical cluster trees, asfollows. 1. One server S (preferably one with good connectivity) iselected from the tree. 2. Server S sends itself a global request messagethat causes each proxy server in MT_(full) (that is, each proxy serverin the network) to ask its clients for files for the cluster tree. 3.The clients of each proxy server transmit to the proxy server any filesthat they maintain, which files represent target objects from theappropriate domain that should be added to the cluster tree. 4. Server Sforms a request R1 that, upon receipt, will cause the recipient serverS1 to take the following actions: (a) Build a hierarchical cluster treeof all the files stored on server S1 that-are maintained by users in theuser base of S1. These files correspond to target objects from theappropriate domain. This cluster tree is typically stored entirely onS1, but may in principle be stored in a distributed fashion. (b) Waituntil all servers to which the server S1 has propagated request R havesent the recipient reply messages containing pointers to cluster trees.(c) Merge together the cluster tree created in step 5(a) and the clustertrees supplied in-step 5(b), by sending any server (such as S1 itself) amessage requesting such a merge, as described above. (d) Upon receivinga reply to the message sent in (c), which reply includes a pointer to afile representing the merged cluster tree, forward this reply to thesender of request R1, unless this is S1 itself. 5. Server S sends itselfa global request message that causes all servers in MT_(full) to act onembedded request R1. 6. Server S receives a reply to the. message itsent in 5(c). This reply includes a pointer to a file F that representsthe completed hierarchical cluster tree. Server S multicasts file F to,all proxy servers in MT_(full). Once the hierarchical cluster tree hasbeen created as above, server S can send additional messages through thecluster tree, to arrange that multicast trees MT(C) are created forsufficiently large clusters C, and that each file F is multicast to thetree MT(C), where C is the smallest cluster containing file F.

MATCHING USERS FOR VIRTUAL COMMUNITIES

Virtual Communities

Computer users frequently join other users for discussions on computerbulletin boards, newsgroups, mailing lists, and real-time chat sessionsover the computer network, which may be typed. (as with Internet RelayChat (IRC)), spoken (as with Internet phone), or videoconferenced. Theseforums are herein termed “virtual communities.” In current practice,each virtual community has a specified topic, and users discovercommunities of interest by word of mouth or by examining a long list ofcommunities (typically hundreds or thousands). The users then mustdecide for themselves which of thousands of messages they findinteresting from among those posted to the selected virtual communities,that is, made publicly available to members of those communities. Ifthey desire, they may also write additional messages and post them tothe virtual communities of their choice. The existence of thousands ofInternet bulletin boards (also termed newsgroups) and countless moreInternet mailing lists and private bulletin board services (BBS's)demonstrates the very strong interest among members of the electroniccommunity in forums for the discussion of ideas about almost any subjectimaginable. Presently, virtual community creation proceeds in ahaphazard form, usually instigated by a single individual who decidesthat a topic is worthy of discussion. There are protocols on theInternet for voting to determine whether a newsgroup should be created,but there is a large hierarchy of newsgroups (which begin with theprefix “alt.”) that do not follow this protocol.

The system for customized electronic identification of desirable objectsdescribed herein can of course function as a browser for bulletinboards, where target objects are taken to be bulletin boards, orsubtopics of bulletin boards, and each target profile is the clusterprofile for a cluster of documents posted on some bulletin board. Thus,a user can locate bulletin boards of interest by all the navigationaltechniques described above, including browsing and querying. However;this method only serves to locate existing virtual communities. Becausepeople have varied and varying complex interests, it is desirable toautomatically locate groups of people with common interests in order toform virtual communities. The Virtual Community Service (VCS) describedbelow is a network-based agent that seeks out users of a network withcommon interests, dynamically creates bulletin boards or electronicmailing lists for those users, and introduces them to each otherelectronically via e-mail. It is useful to note that once virtualcommunities have been created by VCS, the other browsing and filteringtechnologies described above can subsequently be used to help a userlocate particular virtual communities (whether pre-existing orautomatically generated by VCS); similarly, since the messages sent to agiven virtual community may vary in interest and urgency for a user whohas joined that community, these browsing and filtering technologies(such as the e-mail filter) can also be used to alert the user to urgentmessages and to screen out uninteresting ones.

The functions of the Virtual Community Service are general functionsthat-could be implemented-on any network ranging from an office network-in a small company to the World Wide Web or the Internet. The four mainsteps in the procedure are: 1. Scan postings to existing virtualcommunities. 2. Identify groups of users with common interests. 3. Matchusers with virtual communities, creating new virtual communities whennecessary. 4. Continue to enroll additional users in the existingvirtual communities.

More generally, users may post messages to virtual communitiespseudonymously, even employing different pseudonyms for differentvirtual communities. (Posts not employing a pseudonymous mix path may,as usual, be considered to be posts employing a non-secure pseudonym,namely the user's true network address.) Therefore, the above steps maybe expressed more generally as follows: 1. Scan pseudonymous postings toexisting virtual communities. 2. Identify groups of pseudonyms whoseassociated users have common interests. 3. Match pseudonymous users withvirtual communities, creating new virtual communities when necessary. 4.Continue to enroll additional pseudonymous users in the existing virtualcommunities. Each of these steps can be carried out as described below.

Scanning

Using the technology described above, Virtual Community Serviceconstantly scans all the messages posted to all the newsgroups andelectronic mailing lists on a given network, and constructs a targetprofile for each message found. The network can be the Internet, or aset of bulletin boards maintained by America Online, Prodigy, orCompuServe, or a smaller set of bulletin boards that might be local to asingle organization, for example a large company, a law firm, or auniversity. The scanning activity need not be confined to bulletinboards and mailing lists that were created by Virtual Community Service,but may also be used to scan the activity of communities that predateVirtual Community Service or are otherwise created by means outside theVirtual Community Service system, provided that these communities arepublic or otherwise grant their permission.

The target profile of each message includes textual attributesspecifying the title and body text of the message. In the case of aspoken rather than written message, the latter attribute may be computedfrom the acoustic speech data by using a speech recognition system. Thetarget profile also includes an associative attribute listing theauthor(s) and designated recipient(s) of the message, where therecipients may be individuals and/or entire virtual communities; if thisattribute is highly weighted, then the system tends to regard messagesamong the same set of people as being similar or related, even if thetopical similarity of the messages is not clear from their content, asmay happen when some of the messages are very short. Other importantattributes include the fraction of the message that consists of quotedmaterial from previous messages, as well as attributes that aregenerally useful in characterizing documents, such as the message'sdate, length, and reading level.

Virtual Community Identification

Next, Virtual Community Service attempts to identify groups ofpseudonymous users with common interests. These groups, herein termed“pre-communities,” are represented as sets of pseudonyms. WheneverVirtual Community Service identifies a pre-community, it willsubsequently attempt to put the users in said pre-community in contactwith each other, as described below. Each pre-community is said to be“determined” by a cluster of messages, pseudonymous users, searchprofiles, or target objects.

In the usual method for determining pre-communities, Virtual CommunityService clusters the messages that were scanned and profiled in theabove step, based on the similarity of those messages computed targetprofiles, thus automatically finding threads of discussion that showcommon interests among the users. Naturally, discussions in a singlevirtual community tend to show common interests; however, this methoduses all the texts from every available virtual community, includingbulletin boards and electronic mailing lists. Indeed, a user who wishesto initiate or join a discussion on some topic may send a “feelermessage” on that topic to a special mailing list designated for feelermess ages; as a consequence of the scanning procedure described above,the feeler message is automatically grouped with any similarly profiledmessages that have been sent to this special mailing list, to topicalmailing lists, or to topical bulletin boards. The clustering stepemploys “soft clustering,” in which a message may belong to multipleclusters and hence to multiple virtual communities. Each cluster ofmessages that is found by Virtual Community Service and that is: ofsufficient size (for example, 10-20 different messages) determines apre-community whose members are the pseudonymous authors and recipientsof the messages in the cluster. More precisely, the pre-communityconsists of the various pseudonyms under which the messages in thecluster were sent and received.

Alternative methods for determining a pre-community, which do notrequire the scanning step above, include the following: 1.Pre-communities can be generated by grouping together users who havesimilar interests of any sort, not merely Individuals who have alreadywritten or received messages about similar topics. If the user profileassociated with each pseudonym indicates the user's interests, forexample through an associative attribute that indicates the documents orWeb sites a user likes, then pseudonyms can be clustered based on thesimilarity of their associated user profiles, and each of the resultingclusters of pseudonyms determines a pre-community comprising thepseudonyms in the cluster. 2. If each pseudonym has an associated searchprofile set formed through participation in the news clipping servicedescribed above, then all search profiles of all pseudonymous users canbe clustered based on their similarity, and each cluster of searchprofiles determines a pre-community whose members are the pseudonymsfrom whose search profile sets the search profiles in the cluster aredrawn. Such groups of people have been reading about the same topic (or,more generally, accessing similar target objects) and so presumablyshare an interest: 3. If users participate in a news clipping service orany other filtering or browsing system for target objects, then anindividual user can pseudonymously request the formation of a virtualcommunity to discuss a particular cluster of one or more target objectsknown to that system. This cluster of target objects determines apre-community consisting of the pseudonyms of users determined to bemost interested in that cluster (for example; users who have searchprofiles similar to the cluster pro file), together with the pseudonymof the user who requested formation of the virtual community.

Matching Users with Communities

Once Virtual Community Service identifies a cluster C of messages,users, search profiles, or target objects that determines apre-community M, it attempts to arrange for the members of thispre-community to have the chance to participate in a common virtualcommunity V. In many cases, an existing virtual community V may suit theneeds of the pre-community M. Virtual Community Service first attemptsto find such an existing community V. In the case where cluster C is acluster of messages, V may be chosen to be any existing virtualcommunity such that the cluster profile of cluster C is within athreshold distance of the mean: profile of the set of messages recentlyposted to virtual community V; in the case where cluster C is a clusterof users, V may be chosen to be any existing virtual community such thatthe cluster profile of cluster C is within a threshold distance of themean user profile of the active members of virtual community V; in thecase where the cluster C is a cluster of search profiles, V may bechosen to be any existing virtual community such that the clusterprofile of cluster C is within a threshold distance of the clusterprofile of the largest cluster resulting from clustering all the searchprofiles of active members of virtual community V; and in the case wherethe cluster C is a cluster of one or more target objects chosen from aseparate browsing or filtering system, V may be chosen to be anyexisting virtual community initiated in the same way from a clusterwhose cluster profile in that other system is within a thresholddistance of the cluster profile of cluster C. The threshold distanceused in each case is optionally dependent on the cluster variance orcluster diameter of the profile sets whose means are being compared.

If no existing virtual community V meets these conditions and is alsowilling to accept all the users in pre-community M as new members, thenVirtual Community Service attempts to create a new virtual-community V.Regardless of whether virtual community V is an existing community or anewly created community, Virtual Community Service sends an e-mailmessage to each pseudonym P in pre-community M whose associated user Udoes not already belong to virtual community V (under pseudonym P) andhas not previously turned down a request to join virtual community V.The e-mail message informs user U of the existence of virtual communityV, and provides instructions which user U may following order to joinvirtual community V if desired; these instructions vary depending onwhether virtual community V is an existing community or a new community.The message includes a credential, granted to pseudonym P; whichcredential must be presented by user U upon joining the virtualcommunity V, as proof that user U was actually invited to join. If userU wishes to join virtual community V under a different pseudonym Q, userU may first transfer the credential from pseudonym P to pseudonym Q, asdescribed above. The e-mail message further provides an indication ofthe common interests of the community, for example by including a listof titles of messages recently sent to the community, or a charter orintroductory message provided by the community (if available), or alabel generated by the methods described above that identifies thecontent of the cluster of messages, user profiles, search profiles, ortarget objects that was used to identify the pre-community M.

If Virtual Community Service must create a new community V, severalmethods are available for enabling the members of the new community tocommunicate with each other. If the pre-community M is large, forexample containing more than 50 users, then Virtual Community Servicetypically establishes either a multicast tree, as described below, or awidely-distributed bulletin board, assigning a name to the new bulletinboard. If the pre-community M has fewer members, for example 2-50,Virtual Community Service typically establishes either a multicast tree,as described below, or an e-mail mailing list. If the new virtualcommunity V was determined by a cluster of messages, then VirtualCommunity Service kicks off the discussion by distributing thesemessages to all members of virtual community V. In addition to bulletinboards and mailing lists, alternative form that can be created and inwhich virtual communities can gather include real-time typed or spokenconversations (or engagement or distributed multi-user applicationsincluding video games) over the computer network and physical meetings,any of which can be scheduled by a partly automated process whereinVirtual Community Service requests meeting time preferences from allmembers of the pre-community M and then notifies these individuals of anappropriate meeting time.

Continued Enrollment

Even after creation of a new virtual community, Virtual CommunityService, continues to scan other virtual communities for new messageswhose target profiles are similar to the community's cluster profile(average message profile). Copies of any such messages are sent to thenew virtual community, and the pseudonymous authors of these messages,as well as users who show high interest in reading such messages, areinformed by Virtual Community Service (as for pre-community members,above) that they may want to join the community. Each such user can thendecide whether or not to join the community. In the case of InternetRelay Chat (IRC), if the target profile of messages in a real timedialog are (or become) similar to that of a user, VCS may also send anurgent e-mail message to such user whereby the user may be automaticallynotified as soon as the dialog appears, if desired.

With these facilities, Virtual Community Service provides automaticcreation of new virtual communities in any local or wide-area network,as well as maintenance of all virtual communities on the network,including those not created by Virtual Community Service. The coretechnology underlying Virtual Commnunity Service is creating a searchand clustering mechanism that can find articles that are “similar” inthat the users share interests. This is precisely what was describedabove. One must be sure that Virtual Comnmunity Service does not bombardusers with notices about communities in which they have no realinterest. On a very small network a human could be “in the loop”,scanning proposed virtual communities and perhaps :even giving themnames. But on larger networks Virtual Comrnunity Service has to run infilly automatic mode, since it is is likely to find a large number ofvirtual communities.

Delivering Messages to a Virtual Community

Once a virtual community has been identified, it is straightforward forVirtual Community Service to establish a mailing list so that any memberof the virtual community may distribute e-mail to all other members.Another method of distribution is to use a conventional network bulletinboard or newsgroup to distribute the messages to all servers in thenetwork, where they can be accessed by any member of the virtualcommunity. However, these simple methods do not take into account costand performance advantages which accrue from optimizing the constructionof a multicast tree to carry messages to the virtual community. Unlike anewsgroup, a multicast tree distributes messages to only a selected setof servers, and unlike an e-mail mailing list, it does so efficiently.

A separate multicast tree MT(V) is maintained for each virtual communityV, by use of the following four procedures. 1. To construct orreconstruct this multicast tree, the core servers for virtual communityV are taken to be those proxy servers that serve at least onepseudonymnous member of virtual community V. Then the multicast treeMT(V) is established via steps 4-6 in the section “Multicast TreeConstruction Procedure” above. 2. When a new user joins virtualcommunity V, which is an existing virtual community, the user sends amessage to the user's proxy server S. If user's proxy server S is notalready a core server for V, then it is designated as a core server andis added to the multicast tree MT(V), as follows. If more than k servershave been added since the last time the multicast tree MT(V) wasrebuilt, where k is a function of the number of core servers already inthe tree, then the entire tree is simply rebuilt via steps 4-6 in thesection “Multicast Tree Construction Procedure” above. Otherwise, serverS retrieves its locally stored list of nearby core servers for V, andchooses a server S1. Server S sends a control message to S1, indicatingthat it would like to be added to the multicast tree MT(V). Upon receiptof this message, server, S1 retrieves its locally stored subtree G1 ofMT(V), and forms a new graph G from G1 by removing all degree-1 verticesother than S1 itself. Server S1 transmits graph G to server S whichstores it as its locally stored subtree of MT(V). Finally, server Ssends a message to itself and to all servers that are vertices of graphG, instructing these servers to modify their locally stored subtrees ofMT(V) by adding S as a vertex and adding an edge between S1 and S. 3.When a user at a client q wishes to send a message F to virtualcommunity V, client q embeds message F in a request R instructing therecipient to store message F locally, for a limited time, for access bymember s of virtual community V. Request R includes a credential provingthat the user is a member of virtual community V or is otherwiseentitled to post messages to virtual community V (for example is not“black marked” by that or other virtual community members). Client qthen broadcasts request R to all core servers in the multicast treeMT(V), by means of a global request message transmitted to the user'sproxy server as described above. The core servers satisfy request R,provided that they can verify the included credential. 4. In order toretrieve a particular message sent to virtual community V, a user U atclient q initiates the steps described in section “Retrieving Files froma Multicast Tree,” above; If user U does not want to retrieve aparticular message, but rather wants to retrieve all new messages sentto virtual community V, then user U pseudonymously instructs its proxyserver (which is a core server for V) to send it all messages that weremulticast to MT(V) after a certain date. In either case, user U mustprovide a credential proving user U to be a member of virtual communityV, or otherwise entitled to access messages on virtual community V.

SUMMARY

A method has been presented for automatically selecting articles ofinterest to a user. The method generates sets of search profiles for theusers based on such attributes as the relative frequency of occurrenceof words in the articles read by the users, and uses these searchprofiles to efficiently identify future articles of interest. Themethods is characterized by passive monitoring (users do not need toexplicitly rate the articles), multiple search profiles per user(reflecting interest in multiple topics) and use of elements of thesearch profiles which are automatically determined from the data(notably, the TF/IDF measure based on word frequencies and descriptionsof purchasable items). A method has also been presented forautomatically generating menus to allow users to locate and retrievearticles on topics of interest. This method clusters articles based ontheir similarity, as measured by the relative frequency of wordoccurrences. Clusters are labeled either with article titles or with keywords extracted from the article. The method can be applied to largesets of articles distributed over many machines.

It has been further shown how to extend the above methods from articlesto any class of target objects for which profiles can be generated,including news articles, reference or work articles, electronic mail,product or service descriptions, people (based on the articles theyread, demographic data, or the products they buy), and electronicbulletin boards (based on the articles posted to them). A particularconsequence of being able to group people by their interests is that onecan form virtual communities of people of common interest, who can thencorrespond with one another via electronic mail.

I claim:
 1. A method for providing a user with a customized electronicnewspaper that is accessible via an electronic data transmission media,where said users are connected via user terminals and data communicationconnections on said electronic data transmission media to a serversystem which provides said user with access to a plurality of targetobject news articles and advertisements, said method comprising thesteps of: automatically generating separate target profiles for saidplurality of target object news articles and advertisements that areaccessible via said electronic data transmission media, each of saidtarget profiles being generated automatically, by a computer systemrunning a profile generation algorithm, from the contents of anassociated one of said target object news articles and advertisements;automatically generating at least one user target profile interestsummary for a user at a user terminal, each said user target profileinterest summary being generated from said target object profilesassociated with said news articles and advertisements accessed by saiduser; calculating numerical interest values between said at least oneuser target profile interest summary and said target profiles; andautomatically creating a customized electronic newspaper for said userby presenting said user with a customized selection, as a function ofsaid calculated numerical interest values, of said plurality of targetobject news articles and advertisements.
 2. The method of providing auser with a customized electronic newspaper of claim 1, furthercomprising the step of: automatically transmitting a notification tosaid user to identify newly received ones of said target object newsarticles and advertisements of interest to said user, as determined byat least one user target profile interest summary.
 3. The method ofproviding a user with a customized electronic newspaper of claim 2,wherein said step of automatically creating comprises: presenting tosaid user said newly received target object news articles in a rankorder listing based upon the predicted level of interest by said user tosaid target object news articles according to matching criteriaassociated with said at least one user target profile interest summary.4. The method of providing a user with a customized electronic newspaperof claim 1, wherein said step of automatically creating comprises:dynamically creating a rank ordered listing on said server of saidcustomized selection of target object news articles and advertisementsin accordance with at least one of: a predicted degree of interest ofsaid user towards said target object news articles and advertisements,and electronic mailing lists for said user.
 5. The method of providing auser with a customized electronic newspaper of claim 1 furthercomprising the step of: specifically identifying to said user saidcustomized selection of target object news articles in which said targetobject news articles are accessible within an online directory.
 6. Themethod of providing a user with a customized electronic newspaper ofclaim 1 further comprising the step of: specifically identifying to saiduser said customized selection of target object news articles by highlighting hyper links to said selected target object news articles. 7.The method of providing a user with a customized electronic newspaper ofclaim 1 further comprising the step of: enabling said user to perform anon-line search of said plurality of target object news articles via saidelectronic transmission media; and customizing results of said on-linesearch based upon a predicted level of interest by said user to saidtarget object news articles within said on-line search results.
 8. Asystem for providing a user with a customized electronic newspaper thatis accessible via an electronic data transmission media, where saidusers are connected via user terminals and data communicationconnections on said electronic data transmission media to a serversystem which provides said user with access to a plurality of targetobject news articles and advertisements, said system comprising: meansfor automatically generating separate target profiles for said pluralityof target object news articles and advertisements that are accessiblevia said electronic data transmission media, each of said targetprofiles being generated automatically, by a computer system running aprofile generation algorithm, from the contents of an associated one ofsaid target object news articles and advertisements; means forautomatically generating at least one user target profile interestsummary for a user at a user terminal, each said user target profileinterest summary being generated from said target object profilesassociated with said news articles and advertisements accessed by saiduser; means for calculating numerical interest values between said atleast one user target profile interest summary and said target profiles;and means for automatically creating a customized electronic newspaperfor said user by presenting said user with a customized selection, as afunction of said numerical interest values, of said plurality of targetobject news articles and advertisements.
 9. The system for providing auser with a customized electronic newspaper of claim 8, furthercomprising, means for automatically transmitting a notification to saiduser to identify newly received ones of said target object news articlesand advertisements of interest to said user, as determined by said atleast one user target profile interest summary.
 10. The system forproviding a user with a customized electronic newspaper of claim 9,wherein said means for automatically creating comprises: means forpresenting to said user said newly received target object news articlesin a rank order listing based upon the predicted level of interest bysaid user to said target object news articles according to matchingcriteria associated with at least one user target profile interestsummary.
 11. The system for providing a user with a customizedelectronic newspaper of claim 8, wherein said means for automaticallycreating comprises: means for dynamically creating a rank orderedlisting on said server of said customized selection of target objectnews articles and advertisements in accordance with at least one of: apredicted degree of interest of said user towards said target objectnews articles and advertisements, and electronic mailing lists for saiduser.
 12. The system for providing a user with a customized electronicnewspaper of claim 8 further comprising: means for specificallyidentifying to said user said customized selection of target object newsarticles in which of said target object news articles are accessiblewithin an online directory.
 13. The system for providing a user with acustomized electronic newspaper claim 8 further comprising: means forspecially identifying to said user said customized selection of targetobjects news articles by high lighting hyper links to said selectedtarget object news articles.
 14. The system for providing a user with acustomized electronic newspaper of claim 8 further comprising: means forenabling said user to perform an on-line search of said plurality oftarget object news articles via said electronic transmission media; andmeans for customizing results of said on-line search based upon apredicted level of interest by said user to said target object newsarticles within said on-line search results.
 15. A method for providinga user with access to selected ones of a plurality of target objectadvertisements that are accessible via an electronic data transmissionmedia, where said users are connected via user terminals and datacommunication connections on said electronic data transmission media toa server system which provides said user with access to a plurality ofbulletin boards, said method comprising the steps of: automaticallygenerating target object profiles for target object advertisements thatare accessible by said electronic data transmission media, each of saidtarget object profiles being generated automatically, by a computersystem running a profile generation algorithm, from the contents of anassociated one of said target object advertisements; automaticallygenerating at least one user target profile summary for a user at a userterminal, each said user target profile interest summary being generatedfrom said plurality of target object profiles associated with saidtarget object advertisements accessed by said user; calculatingnumerical interest values between said at least one user target profileinterest summary and said target object profiles; and generating acustomized selection, as a function of said numerical interest values,of said plurality of target object advertisements.
 16. The method ofproviding a user with a customized electronic newspaper of claim 15wherein said user is a consumer of an off-line newspaper, furthercomprising the step of: delivering said selected ones of said pluralityof advertisements to said user via an inserted piece of printed materialIn said off-line newspaper.
 17. The method of providing a user with acustomized electronic newspaper of claim 15, wherein said step ofautomatically creating comprises: dynamically creating a rank orderedlisting on said server of said customized selection of target objectadvertisements in accordance with at least one of: a predicted degree ofinterest of said user towards said advertisements, and electronicmailing lists for said user.
 18. A system for providing a user withaccess to selected ones of a plurality of target object advertisementsthat are accessible via an electronic data transmission media, wheresaid users are connected via user terminals and data communicationconnections on said electronic data transmission media server systemwhich provides said user with access to a plurality of bulletin boards,said method comprising: means for automatically generating target objectprofiles for target object advertisements that are accessible by saidelectronic data transmission media, each of said target object profilesbeing generated automatically, by a computer system running a profilegeneration algorithm, from the contents of an associated one of saidtarget object advertisements; means for automatically generating atleast one of said target object advertisements; means for automaticallygenerating at least one user target profile interest summary for a userat a user terminal, each said user target profile interest summary beinggenerated from said plurality of target object profiles associated withsaid target object advertisements accessed by said user; means forcalculating numerical interest values between said at least one usertarget profile interest summary and said target object profiles; andmeans for generating a customized selection, as a function of saidnumerical interest values, of said plurality of target objectadvertisements.
 19. The system for providing a user with a customizedelectronic newspaper of claim 18, wherein said user is a consumer of anoff-line newspaper, further comprising: means for delivering saidselected ones of said plurality of advertisements to said user via aninserted piece of printed material in said off-line newspaper.
 20. Thesystem for providing a user with a customized electronic newspaper ofclaim 18, wherein said means for automatically creating comprises: meansfor dynamically creating a rank ordered listing on said server of saidcustomized selection of target object advertisements in accordance witha least one of: a predicted degree of interest of said user towards saidadvertisements, and electronic mailing lists for said user.